Almost Every 3-Uniform Hypergraph is Class 1Research Paper
Colouring the edges of a graph or hypergraph so that intersecting edges get different colours is the same as partitioning its edges into matchings. The problem appears in scheduling, communication networks and design theory. For ordinary graphs the answer is almost settled: by Vizing's theorem every graph has , and…