Tree containment and degree conditions

2019/12/09 by Stein, Maya · 3 citations
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1912.04004

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.

Cited by

• Paths with two blocks in oriented graphs of large minimum semi-degree
• Unbounded degree spanning hypertrees in Dirac hypergraphs
• Degree conditions for spanning expansion hypertrees

Related

• Ramsey numbers of bounded degree trees versus general graphs
• Abstract approach to Ramsey theory and Ramsey theorems for finite trees
• Some Ramsey-type results
• Ramsey Theory on Infinite Structures and the Method of Strong Coding Trees
• The Ramsey Theory of Henson graphs