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

arXiv1706.03414MaRDI QIDQ6287732FDOQ6287732

Authors: C. Balbuena, Mucuy-kak Guevara, J. R. Portillo, P. Reyes 

Publication date: 11 June 2017

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 $kle10$. - A $2$-connected graph with average degree $$ contains every spider of $4$ legs $S_{1,el{l}_2,el{l}_3,el{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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6287732)