How connectivity affects the extremal number of trees

DOI10.1016/J.JCTB.2024.02.001MaRDI QIDQ6500097zbMATH OpenFDO

Authors Su-yun Jiang, Hong Liu, Nika Salia

Publication date 10 May 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.02.001

zbMATH Keywords

broomsconnected graphsextremal numbertrees

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Connectivity (05C40)

Recommendations

• Connected Turán number of trees
• On the Erdős-Sós conjecture for graphs on n = k + 4 vertices
• On the Erd�s-S�s conjecture
• Constructing trees in graphs with no K_2,s

Cites work

• A Local Approach to the Erdös--Sós Conjecture
• A new series of dense graphs of high girth
• An Erdős-Gallai type theorem for vertex colored graphs
• Connected graphs without long paths
• Cycles in 2-connected graphs
• Extremal graphs for edge blow-up of graphs
• Extremal graphs for intersecting cliques
• Extremal graphs for intersecting triangles
• General lemmas for Berge-Turán hypergraph problems
• scientific article; zbMATH DE number 3652374 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Inverse Turán numbers
• Maximal circuits of graphs. I
• On Erdős-Sós conjecture for trees of large size
• On maximal paths and circuits of graphs
• On the Erdős–Sós conjecture for trees with bounded degree
• On the Erd�s-S�s conjecture
• On the structure of linear graphs
• On the Turán number of forests
• Path Ramsey numbers in multicolorings
• Stability in the Erdős-Gallai theorem on cycles and paths. II
• Stability in the Erdős-Gallai theorems on cycles and paths
• The Erdös-Sós conjecture for graphs of girth 5
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdős‐Sós Conjecture for trees of diameter four
• The history of degenerate (bipartite) extremal graph problems

Cited in

(1)

• Connected Turán number of trees

This page was built for publication: How connectivity affects the extremal number of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500097)