Autor:	Gábor N. Sárközy
Rok vydání:	2022
Předmět:	Set (abstract data type) Combinatorics Discrete mathematics Path (graph theory) Complete graph Discrete Mathematics and Combinatorics Graph (abstract data type) Disjoint sets Monochromatic color Square (algebra) Theoretical Computer Science Vertex (geometry) Mathematics
Zdroj:	Discrete Mathematics. 345:112712
ISSN:	0012-365X
DOI:	10.1016/j.disc.2021.112712
Popis:	The square of a path P is the graph obtained from P by joining every pair of vertices with distance 2 in P. We show that in every 2-colored complete graph on sufficiently many vertices the vertex set can be partitioned by at most 65 vertex disjoint monochromatic square-paths.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7aaca843b11500671f5add760217f9d9 https://doi.org/10.1016/j.disc.2021.112712 Zobrazit plný text záznamu Full Text from ScienceDirect