A lower bound for the number of edges in a graph containing no two cycles of the same length

zbMath0981.05062arXivmath/0206050MaRDI QIDQ5950392

Chunhui Lai

Publication date: 11 December 2001

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0206050

zbMATH Keywords

cycle length

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (3)

On the size of graphs without repeated cycle lengths ⋮ On the number of edges in some graphs ⋮ An old problem of Erdős: a graph without two cycles of the same length

This page was built for publication: A lower bound for the number of edges in a graph containing no two cycles of the same length