Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
Artículo
![Thumbnail](/themes/Mirage2/images/cubierta.jpg)
Open/ Download
Publication date
2019Metadata
Show full item record
Cómo citar
Bustamante, Sebastián
Cómo citar
Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles
Author
Abstract
© 2018 Wiley Periodicals Inc. We show that for every η > 0 there exists an integer n 0 such that every 2-coloring of the 3-uniform complete hypergraph on n ≥ n 0 vertices contains two disjoint monochromatic tight cycles of distinct colors that together cover all but at most ηn vertices. The same result holds if tight cycles are replaced by loose cycles.
Indexation
Artículo de publicación SCOPUS
Identifier
URI: https://repositorio.uchile.cl/handle/2250/171263
DOI: 10.1002/jgt.22417
ISSN: 10970118
03649024
Quote Item
Journal of Graph Theory, Volumen 91, Issue 1, 2019, Pages 5-15
Collections