Abstract
AbstractConventional Ramsey-theoretic investigations for edge-colourings of complete graphs are framed around avoidance of certain configurations. Motivated by considerations arising in the field of Qualitative Reasoning, we explore edge colourings that in addition to forbidding certain triangle configurations also require others to be present. These conditions have natural combinatorial interest in their own right, but also correspond to qualitative representability of certain nonassociative relation algebras, which we will call chromatic.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Algebra and Number Theory
Reference32 articles.
1. Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)
2. Alm, J.F.: 401 and beyond: improved bounds and algorithms for the Ramsey algebra search. J. Integer Seq. 20(8), 10 (2017)
3. Alm, J.F.: Entry A263308 in The On-Line Encyclopedia of Integer Sequences, http://oeis.org/A263308
4. Alm, J.F., Manske, J.: Sum-free cyclic multi-bases and constructions of Ramsey algebras. Discrete Appl. Math. 180, 204–212 (2015)
5. Alspach, B.: The wonderful Walecki construction. Bull. Inst. Comb. Appl 52, 7–20 (2008)