Maximizing five-cycles in \(K_r\)-free graphs
From MaRDI portal
Publication:2048348
DOI10.1016/j.ejc.2021.103367zbMath1469.05088arXiv2007.03064OpenAlexW3167439620MaRDI QIDQ2048348
Publication date: 5 August 2021
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.03064
Related Items (6)
Paths of length three are \(K_{r+1}\)-Turán-good ⋮ The cycle of length four is strictly \(F\)-Turán-good ⋮ Some exact results for non-degenerate generalized Turán problems ⋮ Every graph is eventually Turán-good ⋮ Subgraph densities in \(K_r\)-free graphs ⋮ Supersaturation for subgraph counts
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A problem of Erdős and Sós on 3-graphs
- The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
- On the maximum number of five-cycles in a triangle-free graph
- Inducibility of directed paths
- Pentagons vs. triangles
- On the number of \(C_ 5's\) in a triangle-free graph
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Pentagons in triangle-free graphs
- On the number of pentagons in triangle-free graphs
- General lemmas for Berge-Turán hypergraph problems
- On Berge-Ramsey problems
- Generalized Turán problems for even cycles
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Flag Algebras: A First Glance
- Hypergraphs Do Jump
- A note on the maximum number of triangles in a C5‐free graph
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Sharp bounds for decomposing graphs into edges and triangles
- Minimizing the number of 5-cycles in graphs with given edge-density
- A generalized Turán problem and its applications
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Flag algebras
- Efficient testing of large graphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Maximizing five-cycles in \(K_r\)-free graphs
