Non-repeated cycle lengths and Sidon sequences

DOI10.1007/s11856-021-2222-1zbMath1487.05129arXiv2007.12513OpenAlexW3209855320MaRDI QIDQ2130516

Jie Ma, Tianchi Yang

Publication date: 25 April 2022

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

maximum number of edges2-connected graph without repeated cycle lengths

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (2)

Spectral radius, edge-disjoint cycles and cycles of the same length ⋮ An old problem of Erdős: a graph without two cycles of the same length

Cites Work

• Unnamed Item
• Unnamed Item
• On maximum cycle-distributed graphs
• Covering non-uniform hypergraphs
• On the number of edges in some graphs
• Note on graphs without repeated cycle lengths
• An inequality for B2-sequences
• On a Problem of Sidon in Additive Number Theory, and on some Related Problems

This page was built for publication: Non-repeated cycle lengths and Sidon sequences