Constructing Trees in Graphs whose Complement has no K2,s

DOI10.1017/S0963548302005102zbMath0996.05033OpenAlexW2099014744MaRDI QIDQ3146982

Edward Dobson

Publication date: 3 November 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548302005102

zbMATH Keywords

treessubgraphs

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

On Erdős-Sós conjecture for trees of large size ⋮ Embedding trees in graphs with independence number two ⋮ On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices ⋮ Loebl-Komlós-Sós conjecture: dense case ⋮ A Local Approach to the Erdös--Sós Conjecture ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs ⋮ Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs ⋮ The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition ⋮ The approximate Loebl-Komlós-Sós conjecture and embedding trees in sparse graphs

This page was built for publication: Constructing Trees in Graphs whose Complement has no K_2,s