Recommendations
Cites work
- Boolean Algebras with Operators
- Combinatorial Relations and Chromatic Graphs
- scientific article; zbMATH DE number 3853122 (Why is no real title available?)
- scientific article; zbMATH DE number 2192105 (Why is no real title available?)
- Relation algebras
- Relation algebras by games
- Representability is not decidable for finite relation algebras
- Sum-free cyclic multi-bases and constructions of Ramsey algebras
- Varieties of relation algebras
Cited in
(9)- Subcompletions of representable relation algebras
- A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\mathbb{Z} / p \mathbb{Z}\)
- A reduced upper bound for an edge-coloring problem from relation algebra
- scientific article; zbMATH DE number 38327 (Why is no real title available?)
- Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
- Edge colourings and qualitative representations of chromatic algebras
- Comer schemes, relation algebras, and the flexible atom conjecture
- Monk algebras and representability
- Comer schemes, relation algebras, and the flexible atom conjecture
This page was built for publication: Representability of Ramsey relation algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q745708)