Browsing by Subject "Monochromatic cycle partitioning"
Now showing items 1-2 of 2
-
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Elsevier B.V., 2017)We show that any 2-colouring of the 3-uniform complete hypergraph Kn (3) on n vertices contains two disjoint monochromatic tight cycles of distinct colours covering all but o(n) vertices of Kn (3). The same result holds ...
-
(Springer, 2020)Extending a result of Rado to hypergraphs, we prove that for all s,k,t is an element of N$$s, k, t \in {\mathbb {N}}$$\end{document} with k >= t >= 2 the vertices of every r=s(k-t+1)-edge-coloured countably infinite complete ...