PMMSNP problems forbidding monochromatic cliques admit a full complexity dichotomy under the Rich 2-to-1 Conjecture.
27 Maria Chudnovsky, Linda Cook, James Davies, and Sang-il Oum
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.CC 2representative citing papers
For forbidden families of odd cycles and cliques, the edge-coloring problem with forbidden patterns is poly-time equivalent to its precolored version and to a finite CSP, yielding a P versus NP-complete dichotomy.
citing papers explorer
-
Towards infinite PCSP: a dichotomy for monochromatic cliques
PMMSNP problems forbidding monochromatic cliques admit a full complexity dichotomy under the Rich 2-to-1 Conjecture.
-
Edge-coloring problems with forbidden patterns and planted colors
For forbidden families of odd cycles and cliques, the edge-coloring problem with forbidden patterns is poly-time equivalent to its precolored version and to a finite CSP, yielding a P versus NP-complete dichotomy.