The Turán number of blow-ups of trees

DOI10.1016/j.jctb.2022.05.004zbMath1490.05117arXiv1904.07219OpenAlexW4280614067MaRDI QIDQ2673488

Zoltán Lóránt Nagy, Andrzej Grzesik, Oliver Janzer

Publication date: 10 June 2022

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

extremal graphsprobabilistic methodTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (3)

Tree-Degenerate Graphs and Nested Dependent Random Choice ⋮ Rainbow Turán number of even cycles, repeated patterns and blow-ups of cycles ⋮ Repeated Patterns in Proper Colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supersaturated graphs and hypergraphs
• On a Turán type problem of Erdős
• Norm-graphs: Variations and applications
• Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko
• Compactness results in extremal graph theory
• Improved bounds for the extremal number of subdivisions
• Norm-graphs and bipartite Turán numbers
• Small Dense Subgraphs of a Graph
• Dependent random choice
• Some advances on Sidorenko's conjecture
• Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
• On the Extremal Number of Subdivisions
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On a problem of K. Zarankiewicz
• Ramsey theory and bandwidth of graphs

This page was built for publication: The Turán number of blow-ups of trees