Chromatic graphs, Ramsey numbers and the flexible atom conjecture

zbMATH Open1163.05332MaRDI QIDQ1010763FDOQ1010763

Authors: Jeremy F. Alm, Jacob Manske, Roger 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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

Mathematics Subject Classification ID

Ramsey theory (05D10) Cylindric and polyadic algebras; relation algebras (03G15)

Cited In (7)

• Subcompletions of representable relation algebras
• The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
• Comer schemes, relation algebras, and the flexible atom conjecture
• Directed Ramsey and anti-Ramsey schemes 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}\)
• A reduced upper bound for an edge-coloring problem from relation algebra
• Improved bounds on the size of the smallest representation of relation algebra \(32_{65}\)

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)