An approximate version of the Loebl-Komlos-Sos conjecture

Details An approximate version of the Loebl-Komlos-Sos conjecture An approximate version of the Loebl-Komlos-Sos conjecture

2007-08-24

arxiv.org/abs/0708.3355v2

Mathematics

Combinatorics

29 pages, 6 figures, referees' comments incorporated

Scientific paper

Loebl, Komlos, and Sos conjectured that if at least half of the vertices of a graph G have degree at least some natural number k, then every tree with at most k edges is a subgraph of G. Our main result is an approximate version of this conjecture for large enough n=|V(G)|, assumed that n=O(k). Our result implies an asymptotic bound for the Ramsey number of trees. We prove that r(T_k,T_m)\leq k+m+o(k+m),as k+m tends to infinity.

Affiliated with

Also associated with

No associations

Rating

An approximate version of the Loebl-Komlos-Sos conjecture 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 An approximate version of the Loebl-Komlos-Sos conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An approximate version of the Loebl-Komlos-Sos conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-395207