An old problem of Erdős: a graph without two cycles of the same length
From MaRDI portal
Publication:6162025
DOI10.1016/J.DAM.2023.04.013zbMath1516.05110arXiv2110.04696OpenAlexW4372356314MaRDI QIDQ6162025
Publication date: 15 June 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.04696
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Distance in graphs (05C12)
Cites Work
- On maximum cycle-distributed graphs
- The number of edges in a maximum cycle-distributed graph
- On the size of graphs with all cycles having distinct length
- On simple MCD graphs containing a subgraph homeomorphic to \(K_ 4\)
- Covering non-uniform hypergraphs
- Non-repeated cycle lengths and Sidon sequences
- Spectral radius, edge-disjoint cycles and cycles of the same length
- On the number of edges in some graphs
- On the size of graphs without repeated cycle lengths
- Some unsolved problems on cycles
- Two Classes of Simple MCD Graphs
- Note on graphs without repeated cycle lengths
- A note on the number of edges in a Hamiltonian graph with no repeated cycle length
- On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum
- A lower bound for the number of edges in a graph containing no two cycles of the same length
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An old problem of Erdős: a graph without two cycles of the same length