Math 2.0

Resources / preprint

The terminal leave in random greedy hypergraph matching X2NNNW8CX5

URIm2://res/X2NNNW8CX5
Kindpreprint
CreatorsPeter Keevash
Date2026-10-14
MSC05-XX
Subjectsarxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-14
IdsarXiv 2610.20414

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
Near-regular candidate degreesstatementcorollary 6.2arxiv
Uniform handoff event for bounded templatesstatementproposition 8.3arxiv
Independent-cover asymptoticsstatementtheorem 4.1arxiv
Resource stabilitystatementtheorem 7.1arxiv
Shadow-chain balancestatementlemma 7.7arxiv
Finite determinationstatementlemma 3.3arxiv
Candidate repetitions precede resource repetitionsstatementlemma 3.4arxiv
Message estimatestatementlemma 4.3arxiv
Bounded cyclic-type countstatementlemma 8.2arxiv
Correctness of the finite querystatementlemma 3.2arxiv
Endpoint-rooted chain countsstatementlemma 7.6arxiv
One-ended chain balancestatementlemma 7.5arxiv
First-label couplingstatementlemma 3.5arxiv
Uniform exposure of one candidate typestatementlemma 5.3arxiv
Residual estimatestatementlemma 4.4arxiv
Shadow-fibre mixingstatementlemma 7.4arxiv
Collision comparisonstatementtheorem 5.1arxiv
Short-cycle candidate boundstatementtheorem 8.1arxiv
Exact logarithmic equationstatementlemma 4.2arxiv
Random greedy matchingstatementtheorem 3.1arxiv
Resource-fibre mixingstatementlemma 7.3arxiv
Local role frequenciesstatementlemma 7.2arxiv
Exact cavity equationsstatementproposition 3.6arxiv
Anchored count for long first collisionsstatementlemma 5.4arxiv
Polynomial trajectory lies before the balanced cutoffstatementlemma 8.4arxiv
Two-path visitationstatementlemma 5.2arxiv
Terminal $L^2$ asymptoticstatementtheorem 6.1arxiv

Catalogue records