On Ramsey numbers and \(K_ r\)-coloring of graphs
From MaRDI portal
Publication:2550031
DOI10.1016/0095-8956(72)90034-2zbMath0229.05117OpenAlexW2004120849MaRDI QIDQ2550031
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90034-2
Related Items (12)
A Folkman Linear Family ⋮ Small minimal $(3, 3)$-Ramsey graphs ⋮ On some edge Folkman numbers, small and large ⋮ Chromatic vertex Folkman numbers ⋮ Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers ⋮ Unnamed Item ⋮ \(p\)-arrangeable graphs are Folkman linear ⋮ Sur les R-coloriages minimaux ⋮ On a bound of Graham and Spencer for a graph-colouring constant ⋮ On minimal Ramsey graphs and Ramsey equivalence in multiple colours ⋮ On Some Open Questions for Ramsey and Folkman Numbers ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
Cites Work
- A uniqueness theorem for edge-chromatic graphs
- Construction of Special Edge-Chromatic Graphs
- Upper bounds for some Ramsey numbers
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
- Some graph theoretic results associated with Ramsey's theorem
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- Combinatorial Relations and Chromatic Graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: On Ramsey numbers and \(K_ r\)-coloring of graphs
