Chromatic graphs, Ramsey numbers and the flexible atom conjecture
From MaRDI portal
(Redirected from Publication:1010763)
Recommendations
- 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
Cited in
(7)- Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
- A reduced upper bound for an edge-coloring problem from relation algebra
- 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}\)
- Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
- Subcompletions of representable 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)