On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
From MaRDI portal
Publication:3300687
zbMath1444.05105arXiv1904.01937MaRDI QIDQ3300687
Aleksandar Bikov, Nedyalko Dimov Nenov
Publication date: 29 July 2020
Full work available at URL: https://arxiv.org/abs/1904.01937
Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)
Related Items (3)
On some generalized vertex Folkman numbers ⋮ Unnamed Item ⋮ \(p\)-arrangeable graphs are Folkman linear
Uses Software
Cites Work
- Large triangle-free subgraphs in graphs without \(K_ 4\)
- Three hundred million points suffice
- On group partitions associated with lower bounds for symmetric Ramsey numbers
- Small Ramsey numbers
- On some edge Folkman numbers, small and large
- Practical graph isomorphism. II.
- On Ramsey numbers and \(K_ r\)-coloring of graphs
- On a bound of Graham and Spencer for a graph-colouring constant
- The Mathematical Coloring Book
- Explicit Construction of Small Folkman Graphs
- On the Folkman Numberf(2, 3, 4)
- Computation of the Folkman numberFe(3, 3; 5)
- ARTICLES
- Small minimal $(3, 3)$-Ramsey graphs
- The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
- 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
- On minimal Folkman graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
