Modular Chromatic Index Determined for Random Hypergraphs

A study of random uniform hypergraphs shows the modular chromatic index equals k when the vertex count n is divisible by gcd(k,r); otherwise it stays within max(k,r)–k+r+1. Read more: getnews.me/modular-chromatic-index-... #hypergraph #modularcoloring