Given a lazy regular graph G, we prove that the expansion of G^t is at least sqrt(t) times the expansion of G. This bound is tight and can be generalized to small set expansion. We show some applications of this result
Graph-partitioning problems are a central topic of research in the study of algorithms and complexit...
We revisit the classical question of the relationship between the diameter of a graph and its expans...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined ...
For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two verti...
There are a lot of recent works on generalizing the spectral theory of graphs and graph partitioning...
We consider the problem of testing small set expansion for general graphs. A graph G is a (k,phi)-ex...
In this work, we achieve gap amplification for the Small-Set Expansion problem. Specifically, we sho...
AbstractA class of simple undirected graphs is small if it contains at most n!αn labeled graphs with...
For a graph G, its rth power is constructed by placing an edge between two vertices if they are with...
We present a new approach to showing that random graphs are nearly optimal expanders. This approach ...
summary:In this paper we study various models for web graphs with respect to bounded expansion. All ...
We study the complexity of approximating the vertex expansion of graphs G = (V, E), defined as φV de...
The main paradigm of smoothed analysis on graphs suggests that for any large graph G in a certain cl...
In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is ...
Graph-partitioning problems are a central topic of research in the study of algorithms and complexit...
We revisit the classical question of the relationship between the diameter of a graph and its expans...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
The expansion of a hypergraph, a natural extension of the notion of expansion in graphs, is defined ...
For a graph G, its rth power G^r has the same vertex set as G, and has an edge between any two verti...
There are a lot of recent works on generalizing the spectral theory of graphs and graph partitioning...
We consider the problem of testing small set expansion for general graphs. A graph G is a (k,phi)-ex...
In this work, we achieve gap amplification for the Small-Set Expansion problem. Specifically, we sho...
AbstractA class of simple undirected graphs is small if it contains at most n!αn labeled graphs with...
For a graph G, its rth power is constructed by placing an edge between two vertices if they are with...
We present a new approach to showing that random graphs are nearly optimal expanders. This approach ...
summary:In this paper we study various models for web graphs with respect to bounded expansion. All ...
We study the complexity of approximating the vertex expansion of graphs G = (V, E), defined as φV de...
The main paradigm of smoothed analysis on graphs suggests that for any large graph G in a certain cl...
In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is ...
Graph-partitioning problems are a central topic of research in the study of algorithms and complexit...
We revisit the classical question of the relationship between the diameter of a graph and its expans...
For an integer d 3 let (d) be the supremum over all with the property that for every > 0 there exi...
DOI
Add to ORKG