Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909): Difference between revisions

@@ Property / cites work @@
+Covering Two-Edge-Coloured Complete Graphs with Two Disjoint Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture
+Normal rank
@@ Property / cites work @@
+An improved bound for the monochromatic cycle partition number
+Normal rank
@@ Property / cites work @@
+On Perfect Matchings in Uniform Hypergraphs with Large Minimum Vertex Degree
+Normal rank
@@ Property / cites work @@
+The Ramsey Number for 3-Uniform Tight Hypergraph Cycles
+Normal rank
@@ Property / cites work @@
+\(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
@@ Property / cites work: \(R(C_n,C_n,C_n)\leqq (4+o(1))n\) / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning Two-Coloured Complete Graphs into  Two Monochromatic Cycles
+Normal rank
@@ Property / cites work @@
+Partitioning edge-coloured complete graphs into monochromatic cycles and paths
+Normal rank
@@ Property / cites work @@
+Improved monochromatic loose cycle partitions in hypergraphs
+Normal rank