Math 2.0

Resources / preprint

Hamiltonicity of mildly pseudorandom regular graphs 6638EFW1NG

URIm2://res/6638EFW1NG
Kindpreprint
CreatorsAlp Müyesser
Date2026-09-28
MSC05-XX
Subjectsarxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-09-28
IdsarXiv 2609.35766

Items in this resource

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

ItemKindWhereSource
Haxellstatementtheorem 3.2arxiv
756REJQ9PPdefinitiondefinitionarxiv
8WK08GXM3Rstatementcorollary 1.4arxiv
Random subsets of expanders contain Hamilton routersstatementlemma 4.7arxiv
Hamilton routerdefinitiondefinition 4.1arxiv
BCEJ1KRXXJstatementlemma 5.1arxiv
EM3J8VMZRMstatementproposition 4.4arxiv
ES8X49R47Adefinitiondefinition 4.3arxiv
GNNERMY435statementlemma 2.1arxiv
Connecting lemmastatementlemma 3.1arxiv
M8TQ6N9FJWstatementproposition 4.2arxiv
Folkloreconjectureconjecture 1.1arxiv
PSC50REMZPstatementlemma 2.4arxiv
Packing short even cyclesstatementlemma 4.6arxiv
Matrix Bernsteinstatementtheorem 2.3arxiv
Expansion inheritance under vertex subsamplingstatementlemma 2.2arxiv
T59B7648H2statementlemma 4.5arxiv
Brada\v{c}--Janzerstatementtheorem 1.2arxiv
XG9W5QBSZRstatementtheorem 1.3arxiv

Catalogue records