Turán Numbers of Multiple Paths and Equibipartite Forests

DOI10.1017/S0963548311000460zbMath1234.05128arXiv1106.5904OpenAlexW2052594572MaRDI 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

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Related Items (39)

Turán numbers for hypergraph star forests ⋮ The Turán numbers of special forests ⋮ The Turán number of disjoint copies of paths ⋮ Generalized Turán number for linear forests ⋮ The Turán number of the graph 3P5 ⋮ 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 the Turán number of 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 ⋮ Edges Not Covered by Monochromatic Bipartite Graph ⋮ An \(A_\alpha\)-spectral Erdős-Pósa theorem ⋮ Saturation numbers for linear forests \(P_5\cup tP_2\) ⋮ Maximum cliques in a graph without disjoint given subgraph ⋮ 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 ⋮ A proof for a conjecture of Gorgol ⋮ Spectral extremal results with forbidding linear forests ⋮ A proof for a conjecture of Gorgol ⋮ Rainbow Turán problems for paths and forests of stars ⋮ On the sum necessary to ensure that a degree sequence is potentially \(H\)-graphic ⋮ On the anti-Ramsey numbers of linear 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\) ⋮ Generalized Turán number of even linear forests ⋮ The lower and upper bounds of Turán number for odd wheels ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ On the Turán number of theta graphs ⋮ The Turàn number of the graph 3P4 ⋮ The Turań number of \(2P_7\) ⋮ Generalized Turán problems for disjoint copies of graphs ⋮ Saturation numbers for \(t P_k\) with \(k\) less than 6

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

This page was built for publication: Turán Numbers of Multiple Paths and Equibipartite Forests