Hostname: page-component-586b7cd67f-rdxmf Total loading time: 0 Render date: 2024-11-28T14:16:30.202Z Has data issue: false hasContentIssue false
  • English
  • Français

On Local Expansion of Vertex-Transitive Graphs

Published online by Cambridge University Press:  01 June 1998

ANDRÁS LUKÁCS
ANDRÁS LUKÁCS
Affiliation:
Computer and Automation Research Institute, Hungarian Academy of Sciences, MTA SZTAKI, Lágymányosi u. 11., H-1111 Budapest, Hungary (e-mail: [email protected])
Get access Rights & Permissions [Opens in a new window]

Abstract

Let X be a vertex-transitive graph and let S be an arbitrary finite subset of its vertices. Denote by @∂S the set of vertices adjacent to S but not in S. Babai and Szegedy proved that for an infinite, connected, locally finite X with subexponential growth we have

formula here

where d(S) is the diameter of S. The aim of this note is to provide a slightly better, tight lower bound on this quantity. We prove that

formula here

under the same conditions.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 7 , Issue 2 , June 1998 , pp. 205 - 209
Copyright
1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)