On the girth of infinite graphs

DOI10.1016/0012-365X(93)90072-2zbMath0791.05061OpenAlexW2073879033WikidataQ127088628 ScholiaQ127088628MaRDI QIDQ685556

Norbert Seifter

Publication date: 8 June 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90072-2

zbMATH Keywords

polynomial growthupper boundCayley graphsgirthgrowth function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Self-avoiding walks and amenability ⋮ Cubic graphs and the golden mean

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit construction of regular graphs without small cycles
• Ramanujan graphs
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Explicit constructions of graphs without short cycles and low density codes
• Graphs with polynomial growth are covering graphs
• Automorphisms of graphs and coverings
• On a Class of Fixed-Point-Free Graphs
• GRAPHS WITH POLYNOMIAL GROWTH
• Some applications of graph contractions
• The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups