Advances on the Conjecture of Erd\H{o}s-S\'os for spiders

Abstract: - A hamiltonian graph

G

verifying

e (G) > n (k - 1) / 2

%with a vertex of degree greater or equal than

k

contains any

k

-spider. - If

G

is a graph with average degree

, then every spider of size

k

is contained in

G

for

k l e 10

. - A

2

-connected graph with average degree

contains every spider of

4

legs

S_{1, e l l_{2}, e l l_{3}, e l l_{4}}

. We claim also that the condition of

2

-connection is not needed, but the proof is very long and it is not included in this document.

This page was built for publication: Advances on the Conjecture of Erd\H{o}s-S\'os for spiders