Abstract: The Turan number of a graph H, ex(n,H), is the maximum number of edges in a graph on n vertices which does not have H as a subgraph. We determine the Turan number and find the unique extremal graph for forests consisting of paths when n is sufficiently large. This generalizes a result of Bushaw and Kettle [ Combinatorics, Probability and Computing 20:837--853, 2011]. We also determine the Turan number and extremal graphs for forests consisting of stars of arbitrary order.
Recommendations
Cites work
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- scientific article; zbMATH DE number 3262986 (Why is no real title available?)
- scientific article; zbMATH DE number 3041944 (Why is no real title available?)
- Cycles of even length in graphs
- Embedding a forest in a graph
- New asymptotics for bipartite Turán numbers
- On Graphs that do not Contain a Thomsen Graph
- On a problem of K. Zarankiewicz
- On maximal paths and circuits of graphs
- On the structure of linear graphs
- On the theory of graphs
- Path Ramsey numbers in multicolorings
- Subtrees and subforests of graphs
- Turán numbers for disjoint copies of graphs
- Turán numbers of multiple paths and equibipartite forests
Cited in
(57)- How connectivity affects the extremal number of trees
- Connected Turán number of trees
- Extremal graphs for the suspension of edge-critical graphs
- The Turán number of \(P_9 \cup P_7\)
- On the Turán numbers of linear forests in bipartite graphs
- Turán numbers of general star forests in hypergraphs
- The maximum number of stars in a graph without linear forest
- The signless Laplacian spectral radius of graphs with forbidding linear forests
- Turán numbers for hypergraph star forests
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Generalized Turán problems for disjoint copies of graphs
- On the Turán number of ordered forests
- On extremal hypergraphs for forests of tight paths
- An extremal result for subgraphs with few edges
- On the Turán number of theta graphs
- Spectral radius conditions for the existence of all subtrees of diameter at most four
- Turán number for odd‐ballooning of trees
- Spectral extremal results with forbidding linear forests
- The complete value of the Turán number of \(3K_{p+1}\)
- The bipartite Turán number and spectral extremum for linear forests
- Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs
- The Turán number of the graph 3P5
- On the spectral radius of graphs without a star forest
- Turán numbers of multiple paths and equibipartite forests
- Hypergraphs not containing a tight tree with a bounded trunk
- The Turán number of blow-ups of trees
- An \(A_\alpha\)-spectral Erdős-Pósa theorem
- The Turan number of \({P_5} \bigcup {P_9}\)
- On the \(A_\alpha\)-spectral radius of graphs without linear forests
- Turán numbers for forests of paths in hypergraphs
- On zero-sum spanning trees and zero-sum connectivity
- The Turán numbers of special forests
- Degree powers in graphs with a forbidden forest
- A note on the Turán number of disjoint union of wheels
- The Turań number of \(2P_7\)
- The Turán number of disjoint copies of paths
- The Turan number of graphs with given decomposition family
- Turán numbers for disjoint paths
- The Turán number for \(4 \cdot S_{\ell}^1\)
- Generalized Turán number of even linear forests
- Generalized Turán number for 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
- Two results about the Turán number of star forests
- On the anti-Ramsey numbers of linear forests
- Rainbow Turán problems for paths and forests of stars
- The Turán number of star forests
- On the anti-Ramsey number of forests
- The Turán number for spanning linear forests
- A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
- Erdős-Gallai stability theorem for linear forests
- Turán's problem for trees
- A proof for a conjecture of Gorgol
- A note on the Turán number of an arbitrary star forest
- The Turán number of \(k \cdot S_\ell \)
- Some new results on the Turán number of star forests
- On Turán number for \(S_{\ell_1} \cup S_{\ell_2}\)
This page was built for publication: On the Turán number of forests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396789)
