Some sharp results on the generalized Turán numbers

DOI10.1016/j.ejc.2019.103026zbMath1428.05141arXiv1802.01091OpenAlexW2978070439MaRDI QIDQ2011146

Yanyan Li

Publication date: 28 November 2019

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

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

zbMATH Keywords

complete graphsTurán graphcomplete bipartite graphsextremal graph theoryprojective norm graphsTurán's theoremH-free graphs

Mathematics Subject Classification ID

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

Related Items (33)

Paths of length three are \(K_{r+1}\)-Turán-good ⋮ Subgraph densities in a surface ⋮ Tree densities in sparse graph classes ⋮ Some exact results for generalized Turán problems ⋮ Generalized rainbow Turán problems ⋮ Generalized Turán number for linear forests ⋮ On generalized Turán number of two disjoint cliques ⋮ On supersaturation and stability for generalized Turán problems ⋮ Generalized Turán results for intersecting cliques ⋮ The maximum number of triangles in \(F_k\)-free graphs ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ The cycle of length four is strictly \(F\)-Turán-good ⋮ On Turán numbers for disconnected hypergraphs ⋮ Some exact results for non-degenerate generalized Turán problems ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ On non-degenerate Berge-Turán problems ⋮ Every graph is eventually Turán-good ⋮ Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\) ⋮ Generalized Turán problems for even cycles ⋮ Generalized Turán problems for \(K_{2,t}\) ⋮ The maximum number of cliques in hypergraphs without large matchings ⋮ Triangles in graphs without bipartite suspensions ⋮ Some exact results of the generalized Turán numbers for paths ⋮ The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths ⋮ On Turán-good graphs ⋮ New short proofs to some stability theorems ⋮ 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 ⋮ Counting copies of a fixed subgraph in \(F\)-free graphs ⋮ Further results on the generalized Turán number of spanning linear forests ⋮ 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
• A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
• On the maximum number of five-cycles in a triangle-free graph
• An improved error term for minimum \(H\)-decompositions of graphs
• Supersaturated graphs and hypergraphs
• Pentagons vs. triangles
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• Many cliques in \(H\)-free subgraphs of random graphs
• Some extremal results on complete degenerate hypergraphs
• The maximum number of cliques in graphs without long cycles
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• A new Turán-type theorem for cliques in graphs
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• On the number of pentagons in triangle-free graphs
• Generalized Turán problems for even cycles
• Generalized Turán problems for disjoint copies of graphs
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• The inducibility of complete bipartite graphs
• On the Number of Cycles in a Graph with Restricted Cycle Lengths
• Induced Turán Numbers
• A generalized Turán problem and its applications
• On a problem of K. Zarankiewicz
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Some sharp results on the generalized Turán numbers