Generalized Turán problems for disjoint copies of graphs

DOI10.1016/j.disc.2019.06.022zbMath1419.05110arXiv1712.07072OpenAlexW2963258153MaRDI QIDQ2324501

Máté Vizer, Abhishek Methuku, Dániel Gerbner

Publication date: 11 September 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.07072

zbMATH Keywords

Turán numbersdisjoint copiesgeneralized Turán

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Turán numbers for hypergraph star forests ⋮ Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Some exact results for generalized Turán problems ⋮ Generalized rainbow Turán problems ⋮ Generalized Turán number for linear forests ⋮ On generalized Turán number of two disjoint cliques ⋮ Generalized Turán results for intersecting cliques ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ Spectral extremal graphs for disjoint cliques ⋮ Generalized Turán problems for even cycles ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ Some sharp results on the generalized Turán numbers ⋮ Many H-Copies in Graphs with a Forbidden Tree ⋮ Some results on \(k\)-Turán-good graphs ⋮ Generalized Turán number of even linear forests ⋮ Turán problems for Berge-\((k, p)\)-fan hypergraph ⋮ The shifting method and generalized Turán number of matchings ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ Generalized Turán problems for complete bipartite graphs ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ The generalized Turán number of spanning linear forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• Pentagons vs. triangles
• Compactness results in extremal graph theory
• Cycles of even length in graphs
• New asymptotics for bipartite Turán numbers
• General lemmas for Berge-Turán hypergraph problems
• The Turán number of disjoint copies of paths
• Hypergraphs with No Cycle of a Given Length
• Turán Numbers of Multiple Paths and Equibipartite Forests
• A generalized Turán problem and its applications
• Extremal Results for Berge Hypergraphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On Independent Complete Subgraphs in a Graph
• Many \(T\) copies in \(H\)-free graphs