Random independent sets in uncrowded hypergraphs

Abhishek Dhawan, Lina Li, Abhishek Methuku +2

Given any fixed integer $k\ge 2$ and sufficiently large $d$, we show that the largest possible fractional chromatic number of a $k$-uniform $d$-degenerate uncrowded hypergraph $H$…