A localized approach to generalized Turán problems

DOI10.37236/12132zbMath1548.05177MaRDI QIDQ6614190

Rachel Kirsch, J. D. Nir

Publication date: 7 October 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

extremal set theoryextremal combinatoricsextremal graph theory

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Face vectors of flag complexes
• Pentagons vs. triangles
• On the maximum number of cliques in a graph
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• The maximum number of cliques in graphs without long cycles
• On the number of pentagons in triangle-free graphs
• Many cliques with few edges and bounded maximum degree
• Some exact results for generalized Turán problems
• Powers of Hamilton cycles of high discrepancy are unavoidable
• Graph Theory
• On maximal paths and circuits of graphs
• A Generalized Turán Problem and its Applications
• Many \(T\) copies in \(H\)-free graphs
• Paths are Turán-good
• Many Cliques in Bounded-Degree Hypergraphs
• Every graph is eventually Turán-good
• Localized versions of extremal problems
• Ramsey-Turán problems with small independence numbers
• Exact results on generalized Erdős-Gallai problems
• Localised graph Maclaurin inequalities

This page was built for publication: A localized approach to generalized Turán problems