A simple and sharper proof of the hypergraph Moore bound
A simple and sharper proof of the hypergraph Moore bound
The hypergraph Moore bound characterizes the extremal trade-off between the girth — the number of hyperedges in the smallest cycle or even cover (a subhypergraph with all degrees even) and size — the number of hyperedges in a hypergraph. For graphs, a bound tight up to the leading constant was …