The paper proves the existence of a setwise distinguishable family of 2^(2-o(1)) permutations of [n] and its applications to kernelization complexity of graph coloring problems.
The paper provides a novel construction of a setwise distinguishable family of permutations with a size of 2^(2-o(1))n, improving upon previous results.
Before reading this…
Applications
- →Kernelization complexity of graph coloring problems
To understand this paper, make sure you know these concepts first:
- Graph theoryfind papers →
- Permutationsfind papers →
Abstract
More Like ThisA family of permutations of $[n]$ is called setwise distinguishable if for every permutation in the family there exists a subset of $[n]$ whose image under this permutation differs from its image under any other permutation in the family. We prove that there exists a setwise distinguishable family of $2^{(2-o(1)) \cdot n}$ permutations of $[n]$. The result is optimal up to the $o(1)$ term in the exponent and is achieved through an explicit construction. As an application, we obtain nearly tight conditional lower bounds on the kernelization complexity of graph coloring problems parameterized by the vertex-deletion distance to split graphs. This improves a result of Jansen and Kratsch (Inf. Comput., 2013).