Autor:	John L. Leonard
Rok vydání:	1972
Předmět:	Combinatorics Discrete mathematics Computational Theory and Mathematics Discrete Mathematics and Combinatorics Disjoint sets Graph Theoretical Computer Science Mathematics
Zdroj:	Journal of Combinatorial Theory, Series B. 13:242-250
ISSN:	0095-8956
DOI:	10.1016/0095-8956(72)90059-7
Popis:	It is shown that any graph with n points and l5(n) or more lines, where l5(n)=5n−32, must contain a pair of points joined by five line-disjoint paths. Various graphs are exhibited which have n points and l5(n) − 1 lines and which contain no pairs of points joined by 5 line-disjoint paths, showing l5(n) to be the smallest integer with the stated property.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d96b7de8b0ad97dfd5a4badaf37f91d8 https://doi.org/10.1016/0095-8956(72)90059-7 Zobrazit plný text záznamu