arXiv Analytics

Sign in

arXiv:2009.12611 [math.CO]AbstractReferencesReviewsResources

Reconstruction of a coloring from its homogeneous sets

Claribet Piña, Carlos Uzcátegui

Published 2020-09-26Version 1

We study a reconstruction problem for colorings. Given a finite or countable set $X$, a coloring on $X$ is a function $\varphi: [X]^{2}\to \{0,1\}$, where $[X]^{2}$ is the collection of all 2-elements subsets of $X$. A set $H\subseteq X$ is homogeneous for $\varphi$ when $\varphi$ is constant on $[H]^2$. Let $hom(\varphi)$ be the collection of all homogeneous sets for $\varphi$. The coloring $1-\varphi$ is called the complement of $\varphi$. We say that $\varphi$ is {\em reconstructible} up to complementation from its homogeneous sets, if for any coloring $\psi$ on $X$ such that $hom(\varphi)=hom(\psi)$ we have that either $\psi=\varphi$ or $\psi=1-\varphi$. 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.

Related articles: Most relevant | Search more
arXiv:2403.08104 [math.CO] (Published 2024-03-12)
Minimal reconstructions of a coloring
arXiv:2310.06354 [math.CO] (Published 2023-10-10)
Transversals in a collections of trees
arXiv:0812.1278 [math.CO] (Published 2008-12-06)
Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem