On the Folkman Numberf(2, 3, 4)
From MaRDI portal
Publication:3546252
Recommendations
- Computing the Folkman number F_v(2,2,3;4)
- On the vertex Folkman number \(F(3,4)\)
- Computing the Folkman number F_v(2,2,2,2,2;4)
- scientific article; zbMATH DE number 706775
- On the 3-colouring vertex Folkman number F(2,2,4)
- On the Vertex Folkman Numbers F_v(2,...,2;q)
- An upper bound for the Folkman number F(3, 3; 5)
- On generalized Folkman numbers
- On induced Folkman numbers
- Computation of the Folkman numberFe(3, 3; 5)
Cited in
(19)- Three hundred million points suffice
- \(p\)-arrangeable graphs are Folkman linear
- On some edge Folkman numbers, small and large
- Extremal results in sparse pseudorandom graphs
- On the 3-colouring vertex Folkman number F(2,2,4)
- Computation of the Folkman number F_v (3, 5; 6)
- On the independence number of (3, 3)-Ramsey graphs and the Folkman number F_e(3, 3; 4)
- A Folkman linear family
- Explicit Construction of Small Folkman Graphs
- Some recent results on Ramsey-type numbers
- On globally sparse Ramsey graphs
- Computation of the Folkman numberFe(3, 3; 5)
- An upper bound for the Folkman number F(3, 3; 5)
- The minimum number of vertices of graphs containing two monochromatic triangles for any edge \(2\)-coloring
- The edge Folkman number F_e(3, 3; 4) is greater than 19
- On some open questions for Ramsey and Folkman numbers
- On some generalized vertex Folkman numbers
- An exponential-type upper bound for Folkman numbers
- The Erdős-Hajnal problem list
This page was built for publication: On the Folkman Numberf(2, 3, 4)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546252)
