Ke-Wen Yuan

Random independent sets in uncrowded hypergraphs

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$ (i.e., with girth at least $5$) satisfies \[ \chi_f(H) = (1 + o_d(1)) \left((k-1)\,\frac{d}{\log d}\right)^{\frac{1}{k-1}}. \] In fact, we...