Non-repeated cycle lengths and Sidon sequences
From MaRDI portal
Publication:2130516
Abstract: We prove a conjecture of Boros, Caro, F"uredi and Yuster on the maximum number of edges in a 2-connected graph without repeated cycle lengths, which is a restricted version of a longstanding problem of ErdH{o}s. Our proof together with the matched lower bound construction of Boros, Caro, F"uredi and Yuster show that this problem can be conceptually reduced to the seminal problem of finding the maximum Sidon sequences in number theory.
Recommendations
Cites work
- A note on uniquely pancyclic graphs
- An inequality for B2-sequences
- Covering non-uniform hypergraphs
- Graph theory with applications
- Note on graphs without repeated cycle lengths
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On maximum cycle-distributed graphs
- On the number of edges in some graphs
Cited in
(4)
This page was built for publication: Non-repeated cycle lengths and Sidon sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2130516)