Near-regular hypergraph nibble #
A finite, ceiling-carrying nibble theorem for near-regular uniform hypergraphs. The module deliberately stops before application-specific graph-transfer assemblies.
The one-round covering oracle from the sharp round. Running the tight-band schedule
LeanPool.AsymptoticTrianglePacking.Internal.TightParams r β gives a one-round oracle for every
majority near-regular input with a global degree ceiling and low codegree.
NibbleTheoremMostCeil, unconditionally.
NibbleTheoremMostCeilSized, unconditionally. The size hypothesis
|V| ≤ K d² is not needed by the tight-band route, so it is simply discarded.
NibbleTheorem, unconditionally.