The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra
Logic
2025-07-17 v1 Combinatorics
Abstract
We prove that the random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra, hereby answering an open question of Barto\v{s}ov\'a and Scow.
Cite
@article{arxiv.2507.12078,
title = {The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra},
author = {Michael Pinsker and Jakub Rydval and Moritz Schöbi and Christoph Spiess},
journal= {arXiv preprint arXiv:2507.12078},
year = {2025}
}