Chromatic vertex Folkman numbers
From MaRDI portal
Publication:2195230
DOI10.37236/7862zbMath1441.05153arXiv1612.08136OpenAlexW3083569122MaRDI QIDQ2195230
Xiaodong Xu, Meilian Liang, Stanislaw P. Radziszowski
Publication date: 8 September 2020
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.08136
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper and lower bounds for \(F_v(4,4;5)\)
- On \(K_s\)-free subgraphs in \(K_{s+k}\)-free graphs and vertex Folkman numbers
- A multiplicative inequality for vertex Folkman numbers
- An almost quadratic bound on vertex Folkman numbers
- The Ramsey property for graphs with forbidden complete subgraphs
- Coloring graph products---a survey
- Set colourings of graphs. (Reprint)
- On Ramsey numbers and \(K_ r\)-coloring of graphs
- On the Vertex Folkman Numbers $F_v(2,...,2;q)$
- Computation of the Folkman numberFe(3, 3; 5)
- Small graphs with chromatic number 5: A computer search
- Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$
- On minimal triangle‐free 6‐chromatic graphs
- Vertex Folkman Numbers and the Minimum Degree of Minimal Ramsey Graphs
- Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
- On minimal Folkman graphs
