Generalized Turán results for intersecting cliques
From MaRDI portal
Publication:6056423
DOI10.1016/j.disc.2023.113710zbMath1525.05086arXiv2105.07297MaRDI QIDQ6056423
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.07297
Related Items
Some exact results for non-degenerate generalized Turán problems ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ On non-degenerate Berge-Turán problems ⋮ Extremal numbers for disjoint copies of a clique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
- Forbidding just one intersection
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Extremal graphs for intersecting cliques
- On the connection between chromatic number, maximal clique and minimal degree of a graph
- Extremal graphs for intersecting triangles
- The complete nontrivial-intersection theorem for systems of finite sets
- On the number of pentagons in triangle-free graphs
- Some sharp results on the generalized Turán numbers
- On Turán-good graphs
- Generalized rainbow Turán problems
- Generalized Turán problems for disjoint copies of graphs
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On Independent Complete Subgraphs in a Graph
- On intersecting families of finite sets
- Many \(T\) copies in \(H\)-free graphs
- Paths are Turán-good
