Counting copies of a fixed subgraph in \(F\)-free graphs

DOI10.1016/j.ejc.2019.103001zbMath1419.05104arXiv1805.07520OpenAlexW2803234700MaRDI QIDQ2323254

Dániel Gerbner, Cory Palmer

Publication date: 30 August 2019

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

complete graphscomplete bipartite graphsprojective norm graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (41)

Paths of length three are \(K_{r+1}\)-Turán-good ⋮ 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 ⋮ The Turán number of Berge-matching in hypergraphs ⋮ Generalized rainbow Turán problems ⋮ A note on the uniformity threshold for Berge hypergraphs ⋮ Some extremal results on hypergraph Turán problems ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ Generalized planar Turán numbers ⋮ On Berge-Ramsey problems ⋮ Generalized Turán problems for double stars ⋮ On the maximum number of copies of H in graphs with given size and order ⋮ On supersaturation and stability for generalized Turán problems ⋮ The Turán number of Berge hypergraphs with stable properties ⋮ The maximum number of triangles in \(F_k\)-free graphs ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ On non-degenerate Berge-Turán problems ⋮ Random polynomial graphs for random Turán problems ⋮ Generalized Turán problems for \(K_{2,t}\) ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ Subgraph densities in \(K_r\)-free graphs ⋮ Triangles in graphs without bipartite suspensions ⋮ Some exact results of the generalized Turán numbers for paths ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs ⋮ On Turán-good graphs ⋮ 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 ⋮ The shifting method and generalized Turán number of matchings ⋮ Maximizing five-cycles in \(K_r\)-free graphs ⋮ Ramsey Problems for Berge Hypergraphs ⋮ Hypergraph based Berge hypergraphs ⋮ Unified approach to the generalized Turán problem and supersaturation ⋮ On the weight of Berge-\(F\)-free hypergraphs ⋮ Generalized Turán problems for complete bipartite graphs ⋮ The generalized Turán number of spanning linear forests

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
• Hypergraph extensions of the Erdős-Gallai theorem
• Pentagons vs. triangles
• On the number of \(C_ 5's\) in a triangle-free graph
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On hypergraphs of girth five
• An Erdős-Gallai type theorem for uniform hypergraphs
• A note on the maximum number of triangles in a \(C_5\)-free graph
• New asymptotics for bipartite Turán numbers
• On the number of pentagons in triangle-free graphs
• Turán numbers for Berge-hypergraphs and related extremal problems
• Some sharp results on the generalized Turán numbers
• Supersaturation for subgraph counts
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• Hypergraphs with No Cycle of a Given Length
• On complete subgraphs of different orders
• On the Number of Cycles in a Graph with Restricted Cycle Lengths
• A generalized Turán problem and its applications
• Turán Problems and Shadows III: Expansions of Graphs
• Extremal Results for Berge Hypergraphs
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On a problem of K. Zarankiewicz
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Counting copies of a fixed subgraph in \(F\)-free graphs