Loading problem…
Status
On this page
Status
Topics
Problem 780
Suppose and the edges of the complete -uniform hypergraph on vertices are -coloured. Prove that some colour class must contain pairwise disjoint edges.
Source: erdosproblems.com/780
- Combinatorics
- Hypergraphs
- Chromatic number
Status
Solved, ProvedAn accepted solution exists. The statement is true.