Tractable temporal and phylogeny constraint languages have limited pp-interpretative power and admit 4-ary pseudo-Siggers polymorphisms, revealing a common core in their proofs.
An algebraic proof of the graph orientation problem dichotomy for forbidden tournaments
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2025 3verdicts
UNVERDICTED 3representative 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.
Three positive answers simplify the scope of the Bodirsky-Pinsker conjecture for infinite templates and connect tractable cases to finite-domain PCSPs via the sandwich method.
citing papers explorer
-
When Darwin met Ianus: dichotomies of expressivity
Tractable temporal and phylogeny constraint languages have limited pp-interpretative power and admit 4-ary pseudo-Siggers polymorphisms, revealing a common core in their proofs.
-
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.
-
Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
Three positive answers simplify the scope of the Bodirsky-Pinsker conjecture for infinite templates and connect tractable cases to finite-domain PCSPs via the sandwich method.