Improved bounds on the size of the smallest representation of relation algebra 32_65
From MaRDI portal
Publication:2159495
Recommendations
Cites work
- A reduced upper bound for an edge-coloring problem from relation algebra
- Chromatic graphs, Ramsey numbers and the flexible atom conjecture
- Relation algebras
- Representations for small relation algebras
- Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\)
- Splitting in Relation Algebras
Cited in
(9)- Improved bounds on the size of the smallest representation of relation algebra $32_{65}$
- A finite representation of relation algebra \(1896_{3013}\)
- A reduced upper bound for an edge-coloring problem from relation algebra
- Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\)
- Comer schemes, relation algebras, and the flexible atom conjecture
- scientific article; zbMATH DE number 67031 (Why is no real title available?)
- Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
- Minimal relation algebras
- 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)