Many $T$ copies in $H$-free graphs

DOI10.1016/J.JCTB.2016.03.004zbMath1348.05100OpenAlexW1533675320MaRDI QIDQ5965526

Publication date: 12 October 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2016.03.004

zbMATH Keywords

complete graphs complete bipartite graphs extremal graph theory $H$-free graphs projective norm graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

Related Items (only showing first 100 items - show all)

A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs ⋮ Regular Turán numbers and some Gan–Loh–Sudakov‐type problems ⋮ The covering lemma and q-analogues of extremal set theory problems ⋮ Stability version of Dirac's theorem and its applications for generalized Turán problems ⋮ Induced Turán problems and traces of 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 ⋮ Random polynomial graphs for random Turán problems ⋮ Many Cliques in Bounded-Degree Hypergraphs ⋮ Every graph is eventually Turán-good ⋮ Exact generalized Turán number for $K_3$ versus suspension of $P_4$ ⋮ Local-vs-global combinatorics ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ On the maximum number of odd cycles in graphs without smaller odd cycles ⋮ On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph ⋮ Exact generalized Turán numbers for even linear forests ⋮ The constructor-blocker game ⋮ Exact results on generalized Erdős-Gallai problems ⋮ Generalized Turán results for edge blow-up of star forests ⋮ Many triangles in $C_5$-free graphs ⋮ On the generalized Turán problem for odd cycles ⋮ The high order spectral extremal results for graphs and their applications ⋮ A localized approach to generalized Turán problems ⋮ Exploring projective norm graphs ⋮ The maximum number of $P_\ell$ copies in $P_k$-free graphs ⋮ The automorphism group of projective norm graphs ⋮ Turán numbers of general star forests in hypergraphs ⋮ Abundance: asymmetric graph removal lemmas and integer solutions to linear equations ⋮ Multicolor Turán numbers. II: A generalization of the Ruzsa-Szemerédi theorem and new results on cliques and odd cycles ⋮ Dense circuit graphs and the planar Turán number of a cycle ⋮ The Turán number of Berge book hypergraphs ⋮ Generalized regular Turán numbers ⋮ On non-degenerate Turán problems for expansions ⋮ Stability from graph symmetrization arguments in generalized Turán problems ⋮ The maximum number of pentagons in a planar graph ⋮ Extremal graphs for Widom-Rowlinson colorings in $k$-chromatic graphs ⋮ On generalized Turán numbers of intersecting cliques ⋮ Paths of length three are $K_{r+1}$-Turán-good ⋮ Turán numbers for hypergraph star forests ⋮ Forbidden families of minimal quadratic and cubic configurations ⋮ Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques ⋮ Subgraph densities in a surface ⋮ Supersaturation of $C_4$: from Zarankiewicz towards Erdős-Simonovits-Sidorenko ⋮ Additive approximation of generalized Turán questions ⋮ 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 ⋮ Generalized Turán number for linear forests ⋮ A note on the uniformity threshold for Berge hypergraphs ⋮ The Generalized Rainbow Turán Problem for Cycles ⋮ On generalized Turán number of two disjoint cliques ⋮ Some extremal results on hypergraph Turán problems ⋮ A note on the Tur\'an number of a Berge odd cycle ⋮ The maximum number of paths of length four in a planar graph ⋮ Forbidding $K_{2,t}$ traces in triple systems ⋮ On Generalized Turán Results in Height Two Posets ⋮ Generalized planar Turán numbers ⋮ Generalized rainbow Turán numbers of odd cycles ⋮ On the abstract chromatic number and its computability for finitely axiomatizable theories ⋮ Some extremal results on complete degenerate hypergraphs ⋮ Planar polynomials and an extremal problem of Fischer and Matoušek ⋮ The maximum number of cliques in graphs without long cycles ⋮ On $r$-uniform linear hypergraphs with no Berge-$K_{2,t}$ ⋮ Generalized Turán problems for double stars ⋮ Extremal problems of 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 ⋮ Generalized Turán results for intersecting cliques ⋮ 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 the maximum number of odd cycles in graphs without smaller odd cycles ⋮ The maximum number of paths of length three in a planar graph ⋮ On Two Problems in Ramsey--Turán Theory ⋮ The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number ⋮ A note on the maximum number of triangles in a $C_5$-free graph ⋮ Rainbow cycles vs. rainbow paths ⋮ Turán problems for $k$-geodetic digraphs ⋮ On the Number of Cycles in a Graph with Restricted Cycle Lengths ⋮ 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 ⋮ Subgraph densities in $K_r$-free graphs ⋮ Triangles in graphs without bipartite suspensions ⋮ Some exact results of the generalized Turán numbers for paths ⋮ Unnamed Item ⋮ $t$-Wise Berge and $t$-Heavy Hypergraphs ⋮ Maximising the number of cycles in graphs with forbidden subgraphs ⋮ The Turán Number of Berge K_4 in Triple Systems ⋮ Many cliques with few edges ⋮ $H$-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups ⋮ Minimizing the numbers of cliques and cycles of fixed size in an $F$-saturated graph ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On the cover Turán number of Berge hypergraphs ⋮ The maximum number of copies of $K_{r,s}$ in graphs without long cycles or paths ⋮ Induced Turán Numbers ⋮ General lemmas for Berge-Turán hypergraph problems ⋮ Forbidden Berge hypergraphs

This page was built for publication: Many $T$ copies in $H$-free graphs

Many \(T\) copies in \(H\)-free graphs