Name
Title | ||
|---|---|---|
Almost partitioning 2-colored complete 3-uniform hypergraphs into two monochromatic tight or loose cycles: BUSTAMANTE et al. |
Abstract | ||
|---|---|---|
We show that for every eta > 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 eta n vertices. The same result holds if tight cycles are replaced by loose cycles. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1002/jgt.22417 | JOURNAL OF GRAPH THEORY |
Keywords | DocType | Volume |
hypergraph,loose cycle,monochromatic partitions,tight cycle | Journal | 91 |
Issue | ISSN | Citations |
1 | 0364-9024 | 0 |
PageRank | References | Authors |
0.34 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sebastián Bustamante | 1 | 0 | 2.03 |
| Hiêp Hàn | 2 | 39 | 8.07 |
| maya stein | 3 | 81 | 15.65 |