A sufficient degree condition for a graph to contain all trees of size \(k\)
From MaRDI portal
Publication:546277
DOI10.1007/s10114-011-9617-6zbMath1222.05019MaRDI QIDQ546277
Alberto Márquez, Camino Balbuena, José Ramón Portillo
Publication date: 24 June 2011
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-011-9617-6
Cites Work
- Edge disjoint placement of graphs
- Asymptotic solution for a new class of forbidden r-graphs
- A variation of a conjecture due to Erdös and Sós
- The Erdös-Sós conjecture for graphs without \(C_ 4\)
- The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
- The Erdös-Sós conjecture for graphs of girth 5
- The Erdős-Sós conjecture for spiders
- Tree embeddings
- Constructing Trees in Graphs whose Complement has no K2,s
- On maximal paths and circuits of graphs
- Packing a tree with a graph of the same size
- [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
- The Erdős‐Sós Conjecture for trees of diameter four
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item