Refuting Feder, Kinne and Rafiey

2017/07/29 by Ross Willard, Willard, Ross
Computer Science · #Advanced Graph Theory Research #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Graph Labeling and Dimension Problems #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.1707.09440

openalex publication_date 2017/07/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

I give an example showing that the recent claimed solution by Feder, Kinne and Rafiey to the CSP Dichotomy Conjecture is not correct.

Cited by

• Dichotomy for Digraph Homomorphism Problems

Related

• Refuting Unique Game Conjecture
• On the inconsistency of Porsch-Röseler cutoff theory. (reply to [arXiv:1208.1166v2])
• A remark on the paper "A Unified Pietsch Domination Theorem"
• Comment on a Paper by Kuo, Parusinski and Paunescu On Jacobian Conjecture
• Note: a counterexample to a conjecture of Gilmer which would imply the union-closed conjecture