Local Expansion of Symmetrical Graphs

Author:

Babai László,Szegedy Mario

Abstract

A graph is vertex-transitive (edge-transitive) if its automorphism group acts transitively on the vertices (edges, resp.). The expansion rate of a subset S of the vertex set is the quotient e(S):= |∂(S)|/|S|, where ∂(S) denotes the set of vertices not in S but adjacent to some vertex in S. Improving and extending previous results of Aldous and Babai, we give very simple proofs of the following results. Let X be a (finite or infinite) vertex-transitive graph and let S be a finite subset of the vertices. If X is finite, we also assume |S| ≤|V(X)/2. Let d be the diameter of S in the metric induced by X. Then e(S) ≥1/(d + 1); and e(S) ≥ 2/(d +2) if X is finite and d is less than the diameter of X. If X is edge-transitive then |δ(S)|/|S| ≥ r/(2d), where ∂(S) denotes the set of edges joining S to its complement and r is the harmonic mean of the minimum and maximum degrees of X. – Diverse applications of the results are mentioned.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference29 articles.

1. [4] Babai L. . Bounded-round interactive proofs in finite groups. SIAM J. Discr. Math., to appear.

2. λ1, Isoperimetric inequalities for graphs, and superconcentrators

3. Théorie du potential sur les groupes et des variétés;Varopoulos;Comptes Rendus Acad. Sci. Paris,1986

4. Eine Eigenschaft der Atome endlicher Graphen

Cited by 22 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Curvature, Diameter and Signs of Graphs;The Journal of Geometric Analysis;2024-08-31

2. On Directed and Undirected Diameters of Vertex-Transitive Graphs;Combinatorica;2024-07-09

3. On the treewidth of Hanoi graphs;Theoretical Computer Science;2022-03

4. Sorting Networks on Restricted Topologies;SOFSEM 2019: Theory and Practice of Computer Science;2019

5. On Small Separations in Cayley and Vertex Transitive Graphs;Journal of Graph Theory;2015-08-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3