On the maximum number of copies of H in graphs with given size and order

DOI10.1002/jgt.22563zbMath1521.05080arXiv1810.00817OpenAlexW3015084000MaRDI QIDQ6055379

Máté Vizer, Balázs Patkós, Dániel T. Nagy, Dániel Gerbner

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/1810.00817

zbMATH Keywords

bipartite graphnumber of subgraphsextremal graph theoryquasi-clique

Mathematics Subject Classification ID

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

Related Items (3)

Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ The upper tail problem for induced 4‐cycles in sparse random graphs ⋮ On a Conjecture of Nagy on Extremal Densities

Cites Work

• Unnamed Item
• On the number of certain subgraphs contained in graphs with a given number of edges
• The maximal number of induced complete bipartite graphs
• On the number of subgraphs of prescribed type of graphs with a given number of edges
• Bounds on the number of complete subgraphs
• Paths of length four
• Asymptotics for the Turán number of Berge-\(K_{2,t}\)
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Multipodal structure and phase transitions in large constrained graphs
• Maximum star densities
• Graphs with maximal number of adjacent pairs of edges
• Paths in graphs
• A generalized Turán problem and its applications
• On the Number of 4-Edge Paths in Graphs With Given Edge Density
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: On the maximum number of copies of H in graphs with given size and order