New Upper Bound on Vertex Folkman Numbers
From MaRDI portal
Publication:5458552
Recommendations
Cites work
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 749960 (Why is no real title available?)
- A Canonical Ramsey Theorem
- A Ramsey type problem concerning vertex colourings
- Computing the Folkman number \(F_v(2,2,3;4)\)
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- New upper bound for a class of vertex Folkman numbers
- On minimal Folkman graphs
- Polarities and \(2k\)-cycle-free graphs
Cited in
(10)- On induced Folkman numbers
- Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs
- An improved lower bound for Folkman's theorem
- Lower bounding the Folkman numbers \(f_v(a_1, \dots, a_s; m - 1)\)
- scientific article; zbMATH DE number 706775 (Why is no real title available?)
- New upper bound for a class of vertex Folkman numbers
- A Ramsey type problem concerning vertex colourings
- An almost quadratic bound on vertex Folkman numbers
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
- Some remarks on vertex Folkman numbers for hypergraphs
This page was built for publication: New Upper Bound on Vertex Folkman Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458552)