Publication:4865531
From MaRDI portal
DOI<229::AID-JGT13>3.0.CO;2-E 10.1002/(SICI)1097-0118(199602)21:2<229::AID-JGT13>3.0.CO;2-EzbMath0841.05017MaRDI QIDQ4865531
Publication date: 25 February 1996
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Unnamed Item, An approximate version of the Loebl-Komlós-Sós conjecture, A sufficient degree condition for a graph to contain all trees of size \(k\), Long paths with endpoints in given vertex-subsets of graphs, A variation of a conjecture due to Erdös and Sós, On graphs which contain each tree of given size, The Erdös-Sós conjecture for graphs without \(C_ 4\), Local and mean Ramsey numbers for trees, On a conjecture about trees in graphs with large girth, The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\), The Erdős-Sós conjecture for spiders, Unnamed Item, Turán Numbers of Multiple Paths and Equibipartite Forests