Small minimal $(3, 3)$-Ramsey graphs

zbMath1474.05274arXiv1604.03716MaRDI QIDQ4994194

Aleksandar Bikov

Publication date: 17 June 2021

Full work available at URL: https://arxiv.org/abs/1604.03716

zbMATH Keywords

independence numberchromatic numberclique numberRamsey graph

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55)

Related Items (2)

Unnamed Item ⋮ On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$

Cites Work

• On nearly regular co-critical graphs
• A note on Ramsey multiplicity
• On the Ramsey multiplicity for stars
• A note on the Ramsey-multiplicity of the circuit
• Small Ramsey numbers
• Practical graph isomorphism. II.
• On Ramsey numbers and \(K_ r\)-coloring of graphs
• Chromatic number of graphs and edge Folkman numbers
• On Sets of Acquaintances and Strangers at any Party
• The minimum degree of Ramsey-minimal graphs
• On the Ramsey multiplicities of graphs—problems and recent results
• Computation of the Folkman numberFe(3, 3; 5)
• Small graphs with chromatic number 5: A computer search
• Generalized Ramsey theory for graphs IV, the Ramsey multiplicity of a graph
• Use of MAX-CUT for Ramsey Arrowing of Triangles
• On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Small minimal $(3, 3)$-Ramsey graphs