Advances on the Conjecture of Erdős-Sós for spiders

Camino Balbuena, Mucuy-Kak Guevara, José R. Portillo +1

- 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 $\bar{d} > k…