Turán numbers for disjoint copies of graphs
From MaRDI portal
Publication:659740
DOI10.1007/s00373-010-0999-5zbMath1234.05129OpenAlexW2023913113MaRDI QIDQ659740
Publication date: 24 January 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-010-0999-5
Related Items (30)
The Turán numbers of special forests ⋮ The Turán number of disjoint copies of paths ⋮ A note on the Turán number of an arbitrary star forest ⋮ The Turán number for \(4 \cdot S_{\ell}^1\) ⋮ On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\) ⋮ Forbidding multiple copies of forestable graphs ⋮ The formula for Turán number of spanning linear forests ⋮ On the Turán number of forests ⋮ Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs ⋮ Turán numbers for disjoint paths ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ The bipartite Turán number and spectral extremum for linear forests ⋮ The complete value of the Turán number of \(3K_{p+1}\) ⋮ Degree powers in graphs with a forbidden forest ⋮ A proof for a conjecture of Gorgol ⋮ A note on the Turán number of disjoint union of wheels ⋮ The Turán number of \(k \cdot S_\ell \) ⋮ A proof for a conjecture of Gorgol ⋮ Some new results on the Turán number of star forests ⋮ The Turán number of star forests ⋮ On extremal hypergraphs for forests of tight paths ⋮ The Turán number of the graph \(2P_5\) ⋮ The lower and upper bounds of Turán number for odd wheels ⋮ Two results about the Turán number of star forests ⋮ The Turàn number of the graph 3P4 ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ Turán Numbers of Multiple Paths and Equibipartite Forests ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ Saturation numbers for \(t P_k\) with \(k\) less than 6
Cites Work
This page was built for publication: Turán numbers for disjoint copies of graphs
