Some exact results for generalized Turán problems
From MaRDI portal
Publication:2136200
DOI10.1016/j.ejc.2022.103519zbMath1494.05058arXiv2006.03756OpenAlexW4213458687MaRDI QIDQ2136200
Publication date: 10 May 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.03756
Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38)
Related Items (9)
Generalized Turán problems for double stars ⋮ Paths are Turán-good ⋮ The cycle of length four is strictly \(F\)-Turán-good ⋮ Some exact results for non-degenerate generalized Turán problems ⋮ On non-degenerate Berge-Turán problems ⋮ Every graph is eventually Turán-good ⋮ Generalized Turán problems for \(K_{2,t}\) ⋮ Some exact results of the generalized Turán numbers for paths ⋮ Generalized Turán densities in the hypercube
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- The inducibility of graphs
- Extremal graphs for intersecting triangles
- On the number of pentagons in triangle-free graphs
- Some sharp results on the generalized Turán numbers
- Supersaturation for subgraph counts
- Generalized Turán problems for even cycles
- Counting copies of a fixed subgraph in \(F\)-free graphs
- Generalized Turán problems for disjoint copies of graphs
- The Maximum Number of Triangles in C2k+1-Free Graphs
- A Spectral Erdős–Stone–Bollobás Theorem
- A note on the maximum number of triangles in a C5‐free graph
- A Generalized Turán Problem and its Applications
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- On the structure of linear graphs
- Many \(T\) copies in \(H\)-free graphs
This page was built for publication: Some exact results for generalized Turán problems
