Math 2.0

Resources / preprint

Property B for random non-uniform hypergraphs N0EVQ46HBR

URIm2://res/N0EVQ46HBR
Kindpreprint
CreatorsGrzegorz Ryn, Jakub Kozik
Date2026-10-05
MSC05-XX
Subjectsarxiv cs.DM, arxiv math.CO, arxiv math.PR
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-05
IdsarXiv 2610.07379

Items in this resource

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

ItemKindWhereSource
Explicit AKKT success conditionstatementtheorem 4.6arxiv
Expected number of new $3$-tailsstatementlemma 4.2arxiv
Non-uniform upper bound for 2-colorabilitystatementtheorem 3.1arxiv
Active tails have no complex intersectionsstatementproposition 4.5arxiv
Non-uniform lower bound for 2-colorabilitystatementtheorem 3.3arxiv
B4HCE0Y53Kdefinitiondefinitionarxiv
Embedding $\HModelExpected$ into $\RandomCSP$statementproposition A.1arxiv
Non-constructive upper bound for $k$-graphsstatementtheorem 1.1arxiv
AKKT success conditionstatementtheorem 4.1arxiv
EFT8XBBS8Kdefinitiondefinitionarxiv
Short positive intervals and few active edgesstatementproposition 4.3arxiv
Non-uniform coarse threshold theoremstatementtheorem A.2arxiv
Final rounds are tail-freestatementproposition 4.4arxiv
Non-constructive lower bound for $k$-graphsstatementtheorem 1.2arxiv
Normalized density can be arbitrarily largestatementtheorem 5.1arxiv
Non-uniform lower bound for 2-colorability (second-moment methodstatementlemma 3.2arxiv

Catalogue records