paper

Reconstruction of a coloring from its homogeneous sets

arXiv:2009.12611

Abstract

We study a reconstruction problem for colorings. Given a finite or countable set , a coloring on is a function , where is the collection of all 2-elements subsets of . A set is homogeneous for when is constant on . Let be the collection of all homogeneous sets for . The coloring is called the complement of . We say that is {\em reconstructible} up to complementation from its homogeneous sets, if for any coloring on such that we have that either or . We present several conditions for reconstructibility and non reconstructibility. We show that there is a Borel way to reconstruct a coloring from its homogeneous sets.