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 QIDQ2159495FDOQ2159495
Authors: Jeremy F. Alm, Michael Levet, Saeed Moazami, Jorge Montero-Vallejo, Linda Pham, Dave Sexton, Xiaonan Xu 
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
Recommendations
Coloring of graphs and hypergraphs (05C15) Cylindric and polyadic algebras; relation algebras (03G15)
Cites Work
- Relation algebras
- Splitting in Relation Algebras
- Representations for small relation algebras
- Chromatic graphs, Ramsey numbers and the flexible atom conjecture
- Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\)
- A reduced upper bound for an edge-coloring problem from relation algebra
Cited In (9)
- Improved bounds on the size of the smallest representation of relation algebra $32_{65}$
- Title not available (Why is that?)
- Comer schemes, relation algebras, and the flexible atom conjecture
- Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
- Minimal relation algebras
- A reduced upper bound for an edge-coloring problem from relation algebra
- A finite representation of relation algebra \(1896_{3013}\)
- Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\)
- Finite representations for two small relation algebras
This page was built for publication: Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2159495)
