On the lower bound for F_v(k,k;k+1) and F_e(3,4;5)
From MaRDI portal
Publication:3059031
zbMATH Open1207.05148MaRDI QIDQ3059031FDOQ3059031
Authors: Xiaodong Xu, Zehui Shao 
Publication date: 8 December 2010
Recommendations
- Bounds for some generalized vertex Folkman numbers
- New upper bounds for vertex Folkman numbers \(F_v(3,k;k+1)\)
- Upper bounds for the vertex Folkman number \(F_v(3,3,3;4)\) and \(F_v(3,3,3;5)\).
- Lower bounding the Folkman numbers \(f_v(a_1, \dots, a_s; m - 1)\)
- On the Vertex Folkman Numbers $F_v(2,...,2;q)$
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (10)
- An improved lower bound for Folkman's theorem
- On the nonexistence of some generalized Folkman numbers
- New upper bounds for vertex Folkman numbers \(F_v(3,k;k+1)\)
- A note on upper bounds for some generalized Folkman numbers
- An example of a 16-vertex Folkman edge \((3,4)\)-graph without 8-cliques
- On a lower bound for ‖(4/3)k‖
- On the Vertex Folkman Numbers $F_v(2,...,2;q)$
- New Upper Bound for the Edge Folkman Number Fe(3,5;13)
- On the 2-coloring diagonal vertex Folkman numbers with minimal possible clique number
- On some generalized vertex Folkman numbers
This page was built for publication: On the lower bound for \(F_v(k,k;k+1)\) and \(F_e(3,4;5)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059031)
