Note on graphs without repeated cycle lengths

DOI<11::AID-JGT2>3.0.CO;2-H 10.1002/(SICI)1097-0118(199809)29:1<11::AID-JGT2>3.0.CO;2-HzbMath0919.05030OpenAlexW4255776066MaRDI QIDQ4242924

Michael S. Jacobson, Warren E. Shreve, Jenő Lehel, Guantao Chen

Publication date: 23 August 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199809)29:1<11::aid-jgt2>3.0.co;2-h

zbMATH Keywords

extremal graphSidon sequencecycle lengths

Mathematics Subject Classification ID

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

Related Items

Non-repeated cycle lengths and Sidon sequences ⋮ Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ 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 ⋮ (2)-pancyclic graphs ⋮ Covering non-uniform hypergraphs