List Coloring Uncrowded Hypergraphs at the Shattering ThresholdResearch Paper
How many colors does a sparse hypergraph need? For graphs, the greedy bound can be improved by a factor of when short cycles are excluded. Kim proved for graphs of girth at least (Kim, 1995), and Johansson and Molloy extended the rate to triangle-free graphs…