Permutation graphs and unique games
Combinatorics
2016-08-25 v1
Abstract
We study the value of unique games as a graph-theoretic parameter. This is obtained by labeling edges with permutations. We describe the classical value of a game as well as give a necessary and sufficient condition for the existence of an optimal assignment based on a generalisation of permutation graphs and graph bundles. In considering some special cases, we relate XOR games to EDGE BIPARTIZATION, and define an edge-labeling with permutations from Latin squares.
Cite
@article{arxiv.1608.06661,
title = {Permutation graphs and unique games},
author = {Monika Rosicka and Simone Severini},
journal= {arXiv preprint arXiv:1608.06661},
year = {2016}
}
Comments
13 pages, 1 LaTeX figure