Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)
From MaRDI portal
Publication:2159495
DOI10.1007/s00012-022-00791-4OpenAlexW3201966940MaRDI QIDQ2159495
Jorge Montero-Vallejo, Michael Levet, Dave Sexton, Jeremy F. Alm, Xiaonan Xu, Saeed Moazami, Linda Pham
Publication date: 1 August 2022
Published in: Algebra Universalis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.00620
Coloring of graphs and hypergraphs (05C15) Cylindric and polyadic algebras; relation algebras (03G15)
Related Items (2)
Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture ⋮ Comer schemes, relation algebras, and the flexible atom conjecture
Cites Work
- Relation algebras
- Chromatic graphs, Ramsey numbers and the flexible atom conjecture
- Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\)
- Representations for small relation algebras
- A reduced upper bound for an edge-coloring problem from relation algebra
- Splitting in Relation Algebras
This page was built for publication: Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)