Monochromatic partitions of complete uniform hypergraphs (Q2719171)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Monochromatic partitions of complete uniform hypergraphs |
scientific article; zbMATH DE number 1608835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Monochromatic partitions of complete uniform hypergraphs |
scientific article; zbMATH DE number 1608835 |
Statements
21 June 2001
0 references
complete uniform hypergraphs
0 references
vertex partition
0 references
computationally complexity
0 references
Ramsey theorem
0 references
Monochromatic partitions of complete uniform hypergraphs (English)
0 references
Let \(H\) be a \(c\)-(vertex)-colored \(n\)-uniform complete hypergraph. The problem \(P_{n,c,k}\) is to decide whether \(H\) can be partitioned into monochromatic subhypergraphs of order at least \(k\) (where all numbers are fixed positive integers). The main result of this paper is that this problem is polynomial time solvable. The same problem for graphs and for two colors was widely studied earlier.
0 references
