On the Folkman Numberf(2, 3, 4)
From MaRDI portal
Publication:3546252
DOI10.1080/10586458.2008.10129023zbMATH Open1152.05047OpenAlexW2016326717MaRDI QIDQ3546252FDOQ3546252
Authors: Andrzej Dudek, Vojtěch Rödl 
Publication date: 18 December 2008
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.em/1227031897
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 (18)
- On globally sparse Ramsey graphs
- Computation of the Folkman number \(F_v (3, 5; 6)\)
- On the 3-colouring vertex Folkman number \(F(2,2,4)\)
- A Folkman linear family
- Three hundred million points suffice
- On some open questions for Ramsey and Folkman numbers
- \(p\)-arrangeable graphs are Folkman linear
- 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
- On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
- Explicit Construction of Small Folkman Graphs
- Extremal results in sparse pseudorandom graphs
- Computation of the Folkman numberFe(3, 3; 5)
- On some generalized vertex Folkman numbers
- On some edge Folkman numbers, small and large
- Some recent results on Ramsey-type numbers
- An exponential-type upper bound for Folkman numbers
- The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
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)
