Tree containment and degree conditions

DOI10.1007/978-3-030-55857-4_19MaRDI QIDQ2232047zbMATH OpenOpenAlexFDO

Authors Maya Stein

Publication date 4 October 2021

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

zbMATH Keywords

extremal graph theoryErdős-Sós conjectureLoebl-Komós-Sós conjecture

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Generalized Ramsey theory (05C55) Structural characterization of families of graphs (05C75)

Abstract: We survey results and open problems relating degree conditions with tree containment in graphs, random graphs, digraphs and hypergraphs, and their applications in Ramsey theory.

Recommendations

• Trees and degrees
• Tree containment with soft polytomies
• scientific article; zbMATH DE number 7238964
• scientific article; zbMATH DE number 756707
• Bounds on trees
• Obstructions for tree-depth
• Degree conditions and degree bounded trees
• scientific article; zbMATH DE number 4128829

Cited in

(12)

• Antipaths in oriented graphs
• Trees contained in every orientation of a graph
• Antidirected subgraphs of oriented graphs
• Kalai's conjecture in \(r\)-partite \(r\)-graphs
• Embedding loose spanning trees in 3-uniform hypergraphs
• Strong 2-degenerate graph embeddings
• Connected Turán number of trees
• scientific article; zbMATH DE number 3957503 (Why is no real title available?)
• scientific article; zbMATH DE number 7238964 (Why is no real title available?)
• Amenability of Trees
• scientific article; zbMATH DE number 756707 (Why is no real title available?)
• Dirac-type conditions for spanning bounded-degree hypertrees

This page was built for publication: Tree containment and degree conditions

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