On the Turán number of forests
From MaRDI portal
Publication:396789
zbMath1298.05071arXiv1204.3102MaRDI QIDQ396789
Bernard Lidický, Cory Palmer, Hong Liu
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.3102
Related Items (42)
Turán numbers for hypergraph star forests ⋮ 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 ⋮ Generalized Turán number for linear forests ⋮ 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 anti-Ramsey number of forests ⋮ On the spectral radius of graphs without a star forest ⋮ The signless Laplacian spectral radius of graphs with forbidding linear forests ⋮ The formula for Turán number of spanning linear forests ⋮ On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees ⋮ Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs ⋮ A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs ⋮ Turán numbers for disjoint paths ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ Spectral radius conditions for the existence of all subtrees of diameter at most four ⋮ 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 ⋮ The Turán number for spanning linear forests ⋮ Spectral extremal results with forbidding linear forests ⋮ 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 ⋮ Rainbow Turán problems for paths and forests of stars ⋮ 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 ⋮ Generalized Turán number of even linear forests ⋮ 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\) ⋮ Hypergraphs Not Containing a Tight Tree with a Bounded Trunk ⋮ On zero-sum spanning trees and zero-sum connectivity ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ The maximum number of stars in a graph without linear forest
Cites Work
- Embedding a forest in a graph
- Turán numbers for disjoint copies of graphs
- Subtrees and subforests of graphs
- Cycles of even length in graphs
- Path Ramsey numbers in multicolorings
- New asymptotics for bipartite Turán numbers
- Turán Numbers of Multiple Paths and Equibipartite Forests
- On maximal paths and circuits of graphs
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On the theory of graphs
- On the structure of linear graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Turán number of forests
