Math 2.0

Resources / preprint

An upper bound on the proper hat guessing number of graphs DB9WCCW840

URIm2://res/DB9WCCW840
Kindpreprint
CreatorsIoannis Kakatelis
Date2026-10-02
MSC05-XX, 60-XX
Subjectsarxiv math.CO, arxiv math.PR
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-02
IdsarXiv 2610.04124

Items in this resource

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

ItemKindWhereSource
8FVGN95DAVstatementlemma 0.11arxiv
8X2FNQSVGFstatementtheorem 0.1arxiv
91E7MR24E5statementlemma 0.9arxiv
ANX49S9B9Ystatementlemma 0.10arxiv
CJZ36CS88Hstatementlemma 0.12arxiv
CW6MY3GSHFstatementlemma 0.13arxiv
FXYWG105F7statementfact 0.7arxiv
HSKTZ2GQVKstatementlemma 0.8arxiv
NYWC83XJ4Astatementlemma 0.4arxiv
PSE9HAHNQ1definitiondefinition 0.5arxiv
VVQX2EG1J9statementcorollary 0.3arxiv
XY8DQT3VSDstatementcorollary 0.2arxiv
YPCMF4WWSQstatementlemma 0.6arxiv

Catalogue records