On the Number of Cycles in a Graph with Restricted Cycle Lengths
From MaRDI portal
Publication:4602855
DOI10.1137/16M109898XzbMath1379.05058arXiv1610.03476MaRDI QIDQ4602855
Balázs Patkós, Balázs Keszegh, Cory Palmer, Dániel Gerbner
Publication date: 7 February 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.03476
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (6)
Subgraph densities in a surface ⋮ A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ Generalized Turán problems for even cycles ⋮ Some sharp results on the generalized Turán numbers ⋮ Generalized Turán number of even linear forests ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
- On the number of \(C_ 5's\) in a triangle-free graph
- A note on graphs without short even cycles
- Cycles of even length in graphs
- On the number of pentagons in triangle-free graphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: On the Number of Cycles in a Graph with Restricted Cycle Lengths
