Triangle-free graphs with the maximum number of cycles
From MaRDI portal
Publication:898130
DOI10.1016/j.disc.2015.10.008zbMath1327.05170arXiv1501.01088OpenAlexW2109408352MaRDI QIDQ898130
Sergei Tsaturian, Andrii Arman, David S. Gundersson
Publication date: 8 December 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.01088
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Bessel and Airy functions, cylinder functions, ({}_0F_1) (33C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Maximising the number of induced cycles in a graph ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Maximising the number of cycles in graphs with forbidden subgraphs ⋮ The maximum number of cycles in a graph with fixed number of edges
Cites Work
- Cycle-maximal triangle-free graphs
- Cycles in the complement of a tree or other graph
- The maximum number of cycles in the complement of a tree
- Cycles in the complement of a tree
- The number of cycles in a Hamilton graph
- Estimations for the number of cycles in a graph
- On the number of cycles in 3-connected cubic graphs
- Graphs with large maximum degree containing no odd cycles of a given length
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Bounding the locality of distributed routing algorithms
- On the maximum number of cycles in a Hamiltonian graph
- A Remark on Stirling's Formula
- On the Number of Cycles in Planar Graphs
- On the Number of Simple Cycles in Planar Graphs
- Graphentheoretische Extremalprobleme
- Extremal Numbers for Odd Cycles
- On the maximum number of cycles in a planar graph
- Asymptotic behavior of Golomb's Z(n) conjecture (Corresp.)
- On the maximum number of cycles in outerplanar and series-parallel graphs
- 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: Triangle-free graphs with the maximum number of cycles