The Turán number of disjoint copies of paths
From MaRDI portal
Publication:2374168
DOI10.1016/j.disc.2016.08.004zbMath1351.05122arXiv1511.07679OpenAlexW2964175016MaRDI QIDQ2374168
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.07679
Related Items (35)
The Turán numbers of special forests ⋮ 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}\) ⋮ The Turán number of the graph 3P5 ⋮ On the spectral radius of graphs without a star forest ⋮ The signless Laplacian spectral radius of graphs with forbidding linear forests ⋮ Forbidding multiple copies of forestable graphs ⋮ The formula for Turán number of spanning linear forests ⋮ Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Extremal \(P_8\)-free/\(P_9\)-free planar graphs ⋮ Turán numbers for disjoint paths ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ On the \(A_\alpha\)-spectral radius of graphs without linear forests ⋮ 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 ⋮ Erdős-Gallai stability theorem for linear forests ⋮ Spectral extremal results with forbidding linear forests ⋮ 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 ⋮ On the anti-Ramsey numbers of linear forests ⋮ The Turán number of star forests ⋮ On extremal hypergraphs for forests of tight paths ⋮ The lower and upper bounds of Turán number for odd wheels ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Two results about the Turán number of star forests ⋮ On the Turán number of theta graphs ⋮ The Turań number of \(2P_7\) ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ The maximum number of stars in a graph without linear forest ⋮ Saturation numbers for \(t P_k\) with \(k\) less than 6 ⋮ Extremal graphs for two vertex-disjoint copies of a clique
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Turán number of forests
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Turán problems and shadows. I: Paths and cycles
- Turán numbers for disjoint copies of graphs
- Connected graphs without long paths
- Path Ramsey numbers in multicolorings
- Hypergraph Turán numbers of linear cycles
- A survey of Turán problems for expansions
- Turán Numbers of Multiple Paths and Equibipartite Forests
- Turán Numbers for Forests of Paths in Hypergraphs
- On maximal paths and circuits of graphs
- The Turàn number of the graph 3P4
- Extremal Numbers for Odd Cycles
- The History of Degenerate (Bipartite) Extremal Graph Problems
- On Independent Complete Subgraphs in a Graph
- A proof for a conjecture of Gorgol
This page was built for publication: The Turán number of disjoint copies of paths
