Tree containment and degree conditions
DOI10.1007/978-3-030-55857-4_19zbMATH Open1473.05055arXiv1912.04004OpenAlexW2991995358MaRDI QIDQ2232047FDOQ2232047
Authors: Maya Stein
Publication date: 4 October 2021
Full work available at URL: https://arxiv.org/abs/1912.04004
Recommendations
extremal graph theory[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-S%EF%BF%BD%EF%BF%BDs+conjecture&go=Go Erd��s-S��s conjecture][https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Loebl-Kom%EF%BF%BD%EF%BF%BDs-S%EF%BF%BD%EF%BF%BDs+conjecture&go=Go Loebl-Kom��s-S��s conjecture]
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)
Cited In (12)
- Embedding loose spanning trees in 3-uniform hypergraphs
- Trees contained in every orientation of a graph
- Kalai's conjecture in \(r\)-partite \(r\)-graphs
- Connected Turán number of trees
- Amenability of Trees
- Dirac-type conditions for spanning bounded-degree hypertrees
- Antidirected subgraphs of oriented graphs
- Title not available (Why is that?)
- Antipaths in oriented graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strong 2-degenerate graph embeddings
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)