Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 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
-
The Finite Length Property of the Rado Graph and Friends
Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
-
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.