Math 2.0

Resources / preprint

Quantum n-coloring is undecidable for every n $\ge$ 3 K05CHVKH1B

URIm2://res/K05CHVKH1B
Kindpreprint
CreatorsChristian Bo Kidmose-Frederiksen, Alfred Leth Nielsen
Date2026-10-04
Subjectsarxiv quant-ph, arxiv math.CO
Scopeout

Expressions

e1: version, preprint

Date2026-10-04
IdsarXiv 2610.05280

Items in this resource

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

ItemKindWhereSource
Quantum $n$-coloringdefinitiondefinition 2.1arxiv
F9D086PNJ2conjectureconjecture 4.1arxiv
SN65B3672Qstatementlemma 3.1arxiv
TQ99P5621Qstatementtheorem 3.2arxiv

Catalogue records