Math 2.0

Resources / preprint

Coloring 3-colorable graphs with $O(n^{4/23})$ colors via a Gaussian-cover recursion X1YF62ZFB6

URIm2://res/X1YF62ZFB6
Kindpreprint
CreatorsEmile Anand
Date2026-10-01
Subjectsarxiv cs.DS, arxiv cs.CC, arxiv cs.DM, arxiv math.CO
Scopeborder

Expressions

e1: version, preprint

Date2026-10-01
IdsarXiv 2610.01071

Items in this resource

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

ItemKindWhereSource
Rounding correlation shellsstatementlemma 15arxiv
Vector coloringdefinitiondefinition 2arxiv
Norm-sensitive compositionstatementlemma 14arxiv
5Y5ADZ32BDstatementlemma 13arxiv
Weighted compositionstatementlemma 20arxiv
8P7D24JSNEstatementlemma 9arxiv
Bansal--Huang--Leestatementlemma 4arxiv
Karger--Motwani--Sudanstatementlemma 3arxiv
Kawarabayashi--Thorup--Yonedastatementlemma 11arxiv
Dense--sparse combinationstatementlemma 12arxiv
Arora--Chlamt\'a\v{c}--Charikarstatementlemma 6arxiv
Chlamt\'a\v{cstatementlemma 8arxiv
K7XAGCKHSNstatementtheorem 1arxiv
Progress toward a coloringdefinitiondefinition 10arxiv
PAQZF20Y0Xdefinitiondefinition 7arxiv
Finite inequalitiesstatementproposition 17arxiv
PKDDTMSB3Cdefinitiondefinitionarxiv
Gaussian coverdefinitiondefinition 5arxiv
WFJB6DM2G3statementlemma 16arxiv
WW5PSES1WXstatementlemma 19arxiv

Catalogue records