Connected Turán number of trees

DOI10.26493/1855-3974.3109.E4BMaRDI QIDQ6619396zbMATH OpenFDO

Authors Yair Caro, Balázs Patkós, Zsolt Tuza

Publication date 15 October 2024

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.26493/1855-3974.3109.E4B

zbMATH Keywords

connected host graphsextremal graph theorytrees

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• How connectivity affects the extremal number of trees
• On the Turán number of forests
• Turán's problem for trees
• Turán numbers of multiple paths and equibipartite forests

Cites work

• Connected graphs without long paths
• scientific article; zbMATH DE number 3166040 (Why is no real title available?)
• scientific article; zbMATH DE number 3258067 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• On the structure of linear graphs
• On the Turán number of forests
• The history of degenerate (bipartite) extremal graph problems
• The Turán number of disjoint copies of paths
• The Turán number of star forests
• The Turán numbers of special forests
• Tree containment and degree conditions
• Turán numbers of multiple paths and equibipartite forests
• Turán's theorem and k‐connected graphs

Cited in

(2)

• How connectivity affects the extremal number of trees
• A general theorem in spectral extremal graph theory

This page was built for publication: Connected Turán number of trees

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