Chromatic graphs, Ramsey numbers and the flexible atom conjecture
From MaRDI portal
Publication:1010763
zbMath1163.05332MaRDI QIDQ1010763
Jeremy F. Alm, Jacob Manske, Roger D. Maddux
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129985
Related Items (7)
Subcompletions of representable relation algebras ⋮ Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\) ⋮ A reduced upper bound for an edge-coloring problem from relation algebra ⋮ Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture ⋮ 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}\) ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
This page was built for publication: Chromatic graphs, Ramsey numbers and the flexible atom conjecture
