On the distribution of cycle lengths in graphs

DOI10.1002/jgt.3190080402zbMath0551.05058OpenAlexW2006409548MaRDI QIDQ3344236

János Komlós, András Gyárfás

Publication date: 1984

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

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

zbMATH Keywords

chromatic numberminimum degreeedge densitycycle lengths

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items (7)

SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY ⋮ A solution to Erdős and Hajnal’s odd cycle problem ⋮ The lattice of cycles of an undirected graph ⋮ Cycle lengths in sparse graphs ⋮ Cycle lengths in expanding graphs ⋮ On the sum of the reciprocals of cycle lengths in sparse graphs ⋮ Cycle lengths modulo \(k\) in expanders

Cites Work

• On the sum of the reciprocals of cycle lengths in sparse graphs

This page was built for publication: On the distribution of cycle lengths in graphs