Generalized Turán problems for disjoint copies of graphs

DOI10.1016/J.DISC.2019.06.022MaRDI QIDQ2324501zbMATH OpenOpenAlexFDO

Authors Dániel Gerbner, Abhishek Methuku, Máté Vizer

Publication date 11 September 2019

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

disjoint copiesgeneralized TuránTurán numbers

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Abstract: Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices is denoted by $ex(n,H,F)$. We investigate the function $ex(n,H,kF)$, where $kF$ denotes $k$ vertex disjoint copies of a fixed graph $F$. Our results include cases when $F$ is a complete graph, cycle or a complete bipartite graph.

Recommendations

• On generalized Turán number of two disjoint cliques
• Generalized Turán problems for complete bipartite graphs
• Turán numbers for disjoint copies of graphs
• Generalized Turán problems for \(K_{2,t}\)
• Counting copies of a fixed subgraph in F-free graphs

Cites work

• A generalized Turán problem and its applications
• Compactness results in extremal graph theory
• Cycles of even length in graphs
• Extremal results for Berge hypergraphs
• General lemmas for Berge-Turán hypergraph problems
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 970802 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Hypergraphs with no cycle of a given length
• Many \(T\) copies in \(H\)-free graphs
• New asymptotics for bipartite Turán numbers
• On Independent Complete Subgraphs in a Graph
• On the Turán number of forests
• Pentagons vs. triangles
• The history of degenerate (bipartite) extremal graph problems
• The Turán number of disjoint copies of paths
• Turán numbers for disjoint copies of graphs
• Turán numbers of multiple paths and equibipartite forests

Cited in

(51)

• Turán function and H-decomposition problem for gem graphs
• Some sharp results on the generalized Turán numbers
• 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
• Unified approach to the generalized Turán problem and supersaturation
• Generalized Turán problems for complete bipartite graphs
• Further results on the generalized Turán number of spanning linear forests
• The generalized Turán number of spanning linear forests
• Extremal graphs for two vertex-disjoint copies of a clique
• Turán numbers for hypergraph star forests
• 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
• Generalized Turán problems for even cycles
• The maximum number of cliques in hypergraphs without large matchings
• The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths
• The shifting method and generalized Turán number of matchings
• Counting copies of a fixed subgraph in F-free graphs
• Spectral extremal graphs for disjoint cliques
• Generalized Turán problems for \(K_{2,t}\)
• Tree densities in sparse graph classes
• Many H-copies in graphs with a forbidden tree
• Subgraph densities in a surface
• Many \(T\) copies in \(H\)-free graphs
• 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
• Generalized Turán results for intersecting cliques
• Maximum cliques in a graph without disjoint given subgraph
• Some Stability and Exact Results in Generalized Turán Problems
• A non-aligning variant of generalized Tur\'an problems
• On the extremal graphs in generalized Tur\'an problems
• Generalized Tur\'an results for disjoint cliques
• Counting triangles in graphs without vertex disjoint odd cycles
• The constructor-blocker game
• Turán numbers for disjoint copies of graphs
• On generalized Turán numbers of intersecting cliques
• A note on the generalized Turán number of star forests
• Counting cliques without generalized theta graphs
• Generalized Turán problems for disjoint even wheels, and for disjoint bowties
• The maximum number of cliques in graphs that avoid vertex-disjoint copies of path of length two
• The maximum number of cliques in graphs with given fractional matching number and minimum degree
• Counting multiple graphs in generalized Turán problems
• Generalized Turán problems for small graphs
• On the generalized Turán number of star forests
• Maximum number of cliques in \(\{C_{k_1}, C_{k_2}, C_{k_3}, \cdots \}\)-free graphs with \(6 = k_1 < k_2 < \cdots\) and \(k_{i+1} - k_i \leq 5\)
• Turán problem for Berge disjoint cycles in hypergraphs
• Counting cliques with prescribed intersection sizes
• Additive approximation of generalized Turán questions

This page was built for publication: Generalized Turán problems for disjoint copies of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2324501)