Homepage of T.R. Mezei
Homepage of T.R. Mezei
Home
Projects
Publications
Talks
Experience & Contests
Posts
Contact
CV
Light
Dark
Automatic
complete graph
Terminal-Pairability in Complete Graphs
We investigate terminal-pairability properties of complete graphs and improve the known bounds in two open problems. We prove that the complete graph $K_n$ on $n$ vertices is terminal-pairable if the maximum degree $\Delta$ of the corresponding …
Cite
×