Girth of sparse graphs

DOI10.1002/jgt.10023zbMath1176.05038OpenAlexW2528300898MaRDI QIDQ3651179

Endre Szemerédi, Béla Bollobás

Publication date: 8 December 2009

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10023

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (15)

Further approximations for Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture ⋮ On Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture ⋮ Girth and total domination in graphs ⋮ Short rainbow cycles in graphs and matroids ⋮ Rainbow cycles for families of matchings ⋮ On the cop number of graphs of high girth ⋮ Short loop decompositions of surfaces and the geometry of Jacobians ⋮ Geometry. Abstracts from the workshop held June 12--18, 2022 ⋮ On dissemination thresholds in regular and irregular graph classes ⋮ Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture ⋮ Short homotopically independent loops on surfaces ⋮ The minimal length product over homology bases of manifolds ⋮ On almost self-centered graphs and almost peripheral graphs ⋮ Growth of balls in the universal cover of surfaces and graphs ⋮ Systolic geometry of connected sums and cyclic covering.

Cites Work

• Ramanujan graphs
• Edges in graphs with large girth
• Explicit construction of graphs with an arbitrary large girth and of large size
• Cages—a survey
• A new series of dense graphs of high girth
• On the girth of hamiltonian weakly pancyclic graphs
• On the existence of regular n-graphs with given girth
• Unnamed Item

This page was built for publication: Girth of sparse graphs