On supersaturation and stability for generalized Turán problems

DOI10.1002/jgt.22652zbMath1521.05070arXiv1909.13043OpenAlexW3107821991MaRDI QIDQ6055938

Anastasia Halfpap, Cory Palmer

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

stabilityTurán numbersupersaturation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Related Items (2)

Unified approach to the generalized Turán problem and supersaturation ⋮ Supersaturation for subgraph counts

Cites Work

• 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
• Supersaturated graphs and hypergraphs
• On the maximum number of cliques in a graph
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
• On the number of \(C_ 5's\) in a triangle-free graph
• Pentagons in triangle-free graphs
• On the number of pentagons in triangle-free graphs
• Some sharp results on the generalized Turán numbers
• Supersaturation for subgraph counts
• Counting copies of a fixed subgraph in \(F\)-free graphs
• On some extremal problems on \(r\)-graphs
• A survey of Turán problems for expansions
• On complete subgraphs of different orders
• Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: On supersaturation and stability for generalized Turán problems