Loebl-Komlos-Sos Conjecture: dense case

Details Loebl-Komlos-Sos Conjecture: dense case Loebl-Komlos-Sos Conjecture: dense case

2008-05-30

arxiv.org/abs/0805.4834v3

Mathematics

Combinatorics

54 pages, 4 figures; small errors corrected

Scientific paper

We prove a version of the Loebl-Komlos-Sos Conjecture for dense graphs. For
any q>0 there exists a number $n_0\in \mathbb{N}$ such that for any n>n_0 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.

Affiliated with

Also associated with

No associations

Rating

Loebl-Komlos-Sos Conjecture: dense case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Loebl-Komlos-Sos Conjecture: dense case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Loebl-Komlos-Sos Conjecture: dense case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-319306