Chromatic graphs, Ramsey numbers and the flexible atom conjecture
Summary: Let \(K_N\) denote the complete graph on \(N\) vertices with vertex set \(V=V(K_N)\) and edge set \(E=E(K_N)\). For \(x,y \in V\), let \(xy\) denote the edge between the two vertices \(x\) and \(y\). Let \(L\) be any finite set and \(\mathcal M \subseteq L^3\). Let \(c: E \to L\). Let \([n]\) denote the integer set \(\{1,2,\dots,n\}\). For \(x,y,z \in V\), let \(c(xyz)\) denote the ordered triple \((c(xy),c(yz),c(xz))\). We say that \(c\) is good with respect to \(\mathcal M\) if the following conditions obtain: {\parindent=5mm \begin{itemize}\item[1.]\(\forall x,y \in V\) and \(\forall(c(xy),j,k) \in \mathcal M, \exists z \in V\) such that \(c(xyz)=(c(xy),j,k);\) \item[2.] \(\forall x,y,yz \in V, c(xyz) \in\mathcal M\); and \item[3.]\(\forall x \in V \forall \ell \in L \exists y \in V\) such that \(c(xy)=\ell\). \end{itemize}} We investigate particular subsets \({\mathcal M}\subseteq L^{3}\) and those edge colorings of \(K_{N}\) which are good with respect to these subsets \({\mathcal M}\). We also remark on the connections of these subsets and colorings to projective planes, Ramsey theory, and representations of relation algebras. In particular, we prove a special case of the flexible atom conjecture.
- Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
- Large chromatic number and Ramsey graphs
- scientific article; zbMATH DE number 3847434
- scientific article; zbMATH DE number 3308988
- Chromatic Ramsey theory
- Chromatic Ramsey number of acyclic hypergraphs
- Chromatic Ramsey numbers
- Some Ramsey theorems for finite n-colorable and n-chromatic graphs
- Chromatic number of graphs and edge Folkman numbers
- scientific article; zbMATH DE number 773170
- Subcompletions of representable relation algebras
- Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)
- A fast coset-translation algorithm for computing the cycle structure of Comer relation algebras over \(\mathbb{Z} / p \mathbb{Z}\)
- A reduced upper bound for an edge-coloring problem from relation algebra
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
- Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
- Comer schemes, relation algebras, and the flexible atom conjecture
- Monk algebras and representability
- Network satisfaction problems solved by k-consistency
- Comer schemes, relation algebras, and the flexible atom conjecture
- Cyclic group spectra for some small relation algebras
This page was built for publication: Chromatic graphs, Ramsey numbers and the flexible atom conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010763)