Tree containment and degree conditions
Maya Stein
TL;DR
This paper surveys various results and open problems connecting degree conditions with the containment of trees across different types of graphs and hypergraphs, highlighting their relevance in Ramsey theory.
Contribution
It provides a comprehensive overview of existing research and identifies open problems in the area of degree conditions and tree containment.
Findings
Summarizes key results linking degree conditions to tree containment.
Highlights open problems in the field.
Discusses applications in Ramsey theory.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Advanced Graph Theory Research