De Erdös-Sós Conjecture

Referenties

Balbuena, B., Marquez, A. & Portillo, J.R. A Sufficient Degree Condition for a Graph to Contain All Trees of Size k, Acta Mathemica Sinica, English Series, Vol. 27 (2010) 135--140
Brandt, B. & Dobson, E. The Erdös-Sós conjecture for graphs with girth 5, Discrete Mathematics no. 150 (1996) 411--414.
Eaton, N. & Tiner, G. On the Erdös-Sós conjecture for graphs having no path with k+4 vertices, Discrete Mathematics no. 313 (2013) 1621 -- 1629
Erdös, P. & Gallai, T. On maximal paths and circuits of graphs, Acta Mathematica Hungarica 10.3 (1959), 337-357
McLennan, A. The Erdös-Sós conjecture for Trees of Diameter Four, Wiley InterScience, Graph Theory no. 49 (2005) 291--310.
Sacleés, J-F. & Wozniak, M. The Erdös-Sós conjecture for graphs without girth C₄, Journal of combinatorial Theory no. 70 (1997) 367--372.
Sidorenko, A.F., Asymptotic solution for a new class of forbidden r-graphs, Combinatorica 9 (1989), 207-215.
Wang, M., Li, G. & Liu, A., A result of Erdös-Sós conjecture, Ars Combin 55 (2000), 123-127.
Wozniak, M., On the Erdös-Sós conjecture, J Graph Theory 21 (1996), 229-234
Zhou, B., A note on the Erdös-Sós conjecture, Acta math Sci 4 (1984), 287 -289
Het open probleem is gevonden via: AllTreesSubgraphs.
De Universal Tournament Conjecture (1971) is gevonden op Sumner's Universal Tournament Conjecture (1971).