Almost partitioning every $2$-edge-coloured complete $k$-graph into $k$ monochromatic tight cycles

Documenti analoghi

• Polynomial bounds for monochromatic tight cycle partition in $r$-edge-coloured $K_n^{(k)}$
  di: Bandyopadhyay, Debmalya, et al.
  Pubblicazione: (2024)
• The Ramsey number for 4-uniform tight cycles
  di: Lo, Allan, et al.
  Pubblicazione: (2021)
• On $k$-uniform tight cycles: the Ramsey number for $C_{kn}^{(k)}$ and an approximate Lehel's conjecture
  di: Pfenninger, Vincent
  Pubblicazione: (2024)
• Monochromatic odd cycles in edge-coloured complete graphs
  di: Girão, António, et al.
  Pubblicazione: (2024)
• Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
  di: Benevides, Fabrício Siqueira, et al.
  Pubblicazione: (2024)