Local Expansion of Symmetrical Graphs
- 1 March 1992
- journal article
- research article
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 1 (1) , 1-11
- https://doi.org/10.1017/s0963548300000031
Abstract
A graph is vertex-transitive (edge-transitive) if its automorphism group acts transitively on the vertices (edges, resp.). Theexpansion rateof a subsetSof the vertex set is the quotient e(S):= |∂(S)|/|S|, where ∂(S) denotes the set of vertices not inSbut adjacent to some vertex inS. Improving and extending previous results of Aldous and Babai, we give very simple proofs of the following results. LetXbe a (finite or infinite) vertex-transitive graph and letSbe a finite subset of the vertices. IfXis finite, we also assume |S| ≤|V(X)/2. Letdbe the diameter ofSin the metric induced byX. Then e(S) ≥1/(d+ 1); ande(S)≥ 2/(d+2) ifXis finite anddis less than the diameter ofX. IfXis edge-transitive then |δ(S)|/|S| ≥r/(2d), where ∂(S) denotes the set of edges joiningSto its complement andris the harmonic mean of the minimum and maximum degrees ofX. – Diverse applications of the results are mentioned.Keywords
This publication has 16 references indexed in Scilit:
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Isoperimetric inequalities and fractional set systemsJournal of Combinatorial Theory, Series A, 1991
- A Survey on Spectra of infinite GraphsBulletin of the London Mathematical Society, 1989
- On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated AnnealingProbability in the Engineering and Informational Sciences, 1987
- Arc transitive covering digraphs and their eigenvaluesJournal of Graph Theory, 1985
- A short proof for a theorem of Harper about Hamming-spheresDiscrete Mathematics, 1981
- A note on the edges of the n-cubeDiscrete Mathematics, 1976
- Eine Eigenschaft der Atome endlicher GraphenArchiv der Mathematik, 1971
- Connectivity of transitive graphsJournal of Combinatorial Theory, 1970
- Optimal numberings and isoperimetric problems on graphsJournal of Combinatorial Theory, 1966