The random ordered graph is a semi-retract of the canonically ordered atomless Boolean algebra
Michael PinskerJakub RydvalMoritz SchöbiChristoph Spiess
所有作者
Michael PinskerJakub RydvalMoritz SchöbiChristoph Spiess
文献摘要
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šová and Scow.