Loebl-Komlos-Sos Conjecture: dense case
Abstract
We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For each q>0 there exists a number n0∈ N such that for any n>n0 and k>qn the following holds: if G be a graph of order n with at least n/2 vertices of degree at least k, then any tree of order k+1 is a subgraph of G.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.