Cited in
(7)- Bounds on chromatic numbers of multiple factors of a complete graph
- Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers
- Ramsey theory for graph connectivity
- A ramsey-theoretic result involving chromatic numbers
- Chromatic numbers of hypergraphs and coverings of graphs
- scientific article; zbMATH DE number 3683613 (Why is no real title available?)
- Mixed ramsey numbers: Chromatic numbers versus graphs
This page was built for publication: Ramsey theory and chromatic numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1844684)