Turán Numbers of Multiple Paths and Equibipartite Forests

DOI10.1017/S0963548311000460zbMath1234.05128arXiv1106.5904MaRDI QIDQ3103631

Nathan Kettle, Neal Bushaw

Publication date: 8 December 2011

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Sós conjecture

Mathematics Subject Classification ID

05C05: Trees

05C35: Extremal problems in graph theory

05C38: Paths and cycles

Related Items

The Turàn number of the graph 3P4, The Turán number of the graph 3P5, Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs, A proof for a conjecture of Gorgol, A proof for a conjecture of Gorgol, On the Turán number of forests, Rainbow Turán problems for paths and forests of stars, On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic, The Turán number of the graph \(2P_5\), Saturation numbers for linear forests \(P_5\cup tP_2\), Turán numbers of vertex-disjoint cliques in \(r\)-partite graphs, Degree powers in graphs with a forbidden forest, Erdős-Gallai stability theorem for linear forests, Spectral extremal results with forbidding linear forests, On the anti-Ramsey numbers of linear forests, The Turán number of star forests, Generalized Turán number of even linear forests, The lower and upper bounds of Turán number for odd wheels, On the Turán number of theta graphs, Turán numbers for hypergraph star forests, The Turán numbers of special forests, Generalized Turán number for linear forests, 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, On extremal hypergraphs for forests of tight paths, The Turań number of \(2P_7\), Generalized Turán problems for disjoint copies of graphs, The Turán number of disjoint copies of paths, On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees

Cites Work

• Turán numbers for disjoint copies of graphs
• Asymptotic solution for a new class of forbidden r-graphs
• Connected graphs without long paths
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• On maximal paths and circuits of graphs
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• The Erdős‐Sós Conjecture for trees of diameter four
• Constructing trees in graphs with no K_2,s