Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (Q5270411)
From MaRDI portal
scientific article; zbMATH DE number 6734953
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles |
scientific article; zbMATH DE number 6734953 |
Statements
Almost Partitioning a 3-Edge-Colored $K_{n,n}$ into Five Monochromatic Cycles (English)
0 references
23 June 2017
0 references
monochromatic cycle partition
0 references
Ramsey-type problem
0 references
complete bipartite graph
0 references
0 references
