Representability of Ramsey relation algebras

DOI10.1007/s00012-015-0353-0zbMath1322.05062OpenAlexW1168373258MaRDI QIDQ745708

Tomasz Kowalski

Publication date: 14 October 2015

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00012-015-0353-0

zbMATH Keywords

representationsrelation algebrasRamsey-like colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25) Relational systems, laws of composition (08A02)

Related Items (5)

Subcompletions of representable relation algebras ⋮ 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 ⋮ A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\mathbb{Z} / p \mathbb{Z}\)

Cites Work

• Sum-free cyclic multi-bases and constructions of Ramsey algebras
• Relation algebras by games
• Varieties of relation algebras
• Relation algebras
• Representability is not decidable for finite relation algebras
• Boolean Algebras with Operators
• Combinatorial Relations and Chromatic Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Representability of Ramsey relation algebras