Many \(T\) copies in \(H\)-free graphs
From MaRDI portal
Publication:5965526
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
complete graphscomplete bipartite graphsextremal graph theory\(H\)-free graphsprojective norm graphs
Related Items
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, 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, Turán numbers for Berge-hypergraphs and related extremal problems, Some sharp results on the generalized Turán numbers, Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs, Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs, On Turán-good graphs, New short proofs to some stability theorems, Cycles of given lengths in hypergraphs, 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, Turán problems for Berge-\((k, p)\)-fan hypergraph, The shifting method and generalized Turán number of matchings, Maximizing five-cycles in \(K_r\)-free graphs, Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees, A note on stability for maximal \(F\)-free graphs, Extensions of the Erdős–Gallai theorem and Luo’s theorem, Generalised outerplanar Turán numbers and maximum number of \(k\)-vertex subtrees, Hypergraph based Berge hypergraphs, Asymptotics for the Turán number of Berge-\(K_{2,t}\), Unified approach to the generalized Turán problem and supersaturation, Counting copies of a fixed subgraph in \(F\)-free graphs, Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs, Generalized Turán problems for disjoint copies of graphs, Generalized forbidden subposet problems, Generalized Turán problems for complete bipartite graphs, Rainbow saturation, Turán problems for vertex-disjoint cliques in multi-partite hypergraphs, \(C_{2k}\)-saturated graphs with no short odd cycles, The maximum number of stars in a graph without linear forest, Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$, Generalized Turán densities in the hypercube, Further results on the generalized Turán number of spanning linear forests, Counting cliques in 1-planar graphs, Multicolor Ramsey numbers for Berge cycles, The regularity method for graphs with few 4‐cycles, The generalized Turán number of spanning linear forests, Supersaturation for subgraph counts
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- On 3-uniform hypergraphs without a cycle of a given length
- A new proof of the graph removal lemma
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
- On the spectrum of projective norm-graphs
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- On the number of subgraphs of prescribed type of graphs with a given number of edges
- On the maximal number of certain subgraphs in \(K_ r\)-free graphs
- Norm-graphs: Variations and applications
- On \(K^ 4\)-free subgraphs of random graphs
- On hypergraphs of girth five
- Cycles of even length in graphs
- Upper tails for subgraph counts in random graphs
- New asymptotics for bipartite Turán numbers
- On the number of edges of quadrilateral-free graphs
- On the number of pentagons in triangle-free graphs
- On extremal problems of graphs and generalized graphs
- Sharp bounds for some multicolour Ramsey numbers
- The Maximum Number of Triangles in C2k+1-Free Graphs
- On maximal paths and circuits of graphs
- On complete subgraphs of different orders
- Threshold Functions for Ramsey Properties
- Independent sets in hypergraphs
- Turán Problems and Shadows III: Expansions of Graphs
- Maximizing the Number of Independent Sets of a Fixed Size
- Erratum For ‘A Bound on the Number of Edges in Graphs Without an Even Cycle’
- Graphs with many r -cliques have large complete r -partite subgraphs
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On the structure of linear graphs
- Efficient testing of large graphs
- Constructive lower bounds for off-diagonal Ramsey numbers
