Reconstruction of a coloring from its homogeneous sets

DOI10.1007/s00373-022-02597-6OpenAlexW3088128831MaRDI QIDQ2680357

Carlos Uzcátegui, Claribet Piña

Publication date: 29 December 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.12611

zbMATH Keywords

graph reconstructionBorel selectorscoloring of pairsmaximal homogeneous sets

Mathematics Subject Classification ID

Descriptive set theory (03E15) Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Topology and descriptive set theory
• \((-1)\)-hypomorphic graphs with the same 3-element homogeneous subsets
• Ramsey type properties of ideals
• Boolean sum of graphs and reconstruction up to complementation
• A Theorem on Reconstruction of Random Graphs
• BASES AND BOREL SELECTORS FOR TALL FAMILIES
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• The random graph

This page was built for publication: Reconstruction of a coloring from its homogeneous sets