Many H-Copies in Graphs with a Forbidden Tree

DOI10.1137/19M1239052zbMath1428.05056arXiv1811.04287OpenAlexW2992144822MaRDI QIDQ5204067

Shoham Letzter

Publication date: 9 December 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

treesextremal graph theoryTurán

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (max. 100)

Tree densities in sparse graph classes ⋮ Generalized planar Turán numbers ⋮ Triangles in C5‐free graphs and hypergraphs of girth six ⋮ Unified approach to the generalized Turán problem and supersaturation

Cites Work

• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• Generalized forbidden subposet problems
• Pentagons vs. triangles
• The maximum number of cliques in graphs without long cycles
• A note on the maximum number of triangles in a \(C_5\)-free graph
• On the number of pentagons in triangle-free graphs
• Some sharp results on the generalized Turán numbers
• Generalized Turán problems for even cycles
• The shifting method and generalized Turán number of matchings
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Generalized Turán problems for disjoint copies of graphs
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• On complete subgraphs of different orders
• The maximum number of $P_\ell$ copies in $P_k$-free graphs
• A generalized Turán problem and its applications
• Maximizing the Number of Independent Sets of a Fixed Size
• Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Many H-Copies in Graphs with a Forbidden Tree