New Upper Bound for the Edge Folkman Number Fe(3,5;13)
Combinatorics
2008-06-10 v1
Authors:
Nikolay Kolev
Abstract
In this paper we prove that the edge Folkman number Fe(3,5;13) is not greater than 21.
Cite
@article{arxiv.0806.1403,
title = {New Upper Bound for the Edge Folkman Number Fe(3,5;13)},
author = {Nikolay Kolev},
journal= {arXiv preprint arXiv:0806.1403},
year = {2008}
}
Comments
6 pages
Related papers
View all related →
Combinatorics · Mathematics
Upper bound on the edge Folkman number $F_e(3,3,3;13)$
Nikolay Kolev
2011-03-24
Combinatorics · Mathematics
The edge Folkman number $F_e(3, 3; 4)$ is greater than 19
Aleksandar Bikov, Nedyalko Nenov
2019-03-28
Combinatorics · Mathematics
An example of a 16-vertex Folkman edge (3,4)-graph without 8-cliques
N. Kolev, N. Nenov
2007-05-23
Combinatorics · Mathematics
Bounds on some edge Folkman numbers
Nikolay Rangelov Kolev
2011-05-31
Combinatorics · Mathematics
A Note on Upper Bounds for Some Generalized Folkman Numbers
Xiaodong Xu, Meilian Liang, Stanisław Radziszowski
2017-08-02
Combinatorics · Mathematics
New bounds on the vertex Folkman number $F_v(2, 2, 2, 3; 4)$
Aleksandar Bikov
2019-03-28
Combinatorics · Mathematics
New upper bound for a class of vertex Folkman numbers
N. Kolev, N. Nenov
2007-05-23
Combinatorics · Mathematics
Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$
Aleksandar Bikov, Nedyalko Nenov
2019-03-28
Combinatorics · Mathematics
On the independence number of $(3, 3)$-Ramsey graphs and the Folkman number $F_e(3, 3; 4)$
Aleksandar Bikov, Nedyalko Nenov
2020-04-27
Combinatorics · Mathematics
Chromatic number of graphs and edge Folkman numbers
Nedyalko Dimov Nenov
2010-02-24
Combinatorics · Mathematics
On the Vertex Folkman Numbers $F_v(2,...,2;q)$
N. Nenov
2009-03-24
Combinatorics · Mathematics
Edge number report 1: State of the art estimates for $n \leq 43$
Jörgen Backelin
2014-10-08
Combinatorics · Mathematics
An exponential-type upper bound for Folkman numbers
Vojtěch Rödl, Andrzej Ruciński, Mathias Schacht
2017-11-01
Combinatorics · Mathematics
An improved lower bound for Folkman's theorem
József Balogh, Sean Eberhard, Bhargav Narayanan, Andrew Treglown +1
2017-06-28
Data Structures and Algorithms · Computer Science
Partially Optimal Edge Fault-Tolerant Spanners
Greg Bodwin, Michael Dinitz, Caleb Robelle
2021-02-24
Combinatorics · Mathematics
The vertex Folkman numbers $F_v(a_1, ..., a_s; m - 1) = m + 9$, if $\max\{a_1, ..., a_s\} = 5$
Aleksandar Bikov, Nedyalko Nenov
2019-03-28
Combinatorics · Mathematics
An Upper Bound for the Number of Planar Lattice Triangulations
Emile E. Anclin
2007-05-23
Combinatorics · Mathematics
A New Upper Bound for the Ramsey Number of Fans
Vojtěch Dvořák, Harry Metrebian
2021-09-17
Computational Geometry · Computer Science
On the Number of Edges of Fan-Crossing Free Graphs
Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim
2013-11-11
Combinatorics · Mathematics
A Lower Bound for the Number of Edges in a Graph Containing No Two Cycles of the Same Length
Chunhui Lai
2007-05-23
Combinatorics · Mathematics
A short proof of a lower bound for Tur\'an numbers
Dhruv Mubayi
2017-11-01
Combinatorics · Mathematics
An improved upper bound for planar Tur\'an number of double star $S_{2,5}$
Xin Xu, Yue Hu, Xu Zhang
2024-09-04
Combinatorics · Mathematics
An improved upper bound on the oriented diameter of graphs with diameter $4$
Jifu Lin, Lihua You
2026-05-13
Combinatorics · Mathematics
Upper bounds on the extremal number of the 4-cycle
Jie Ma, Tianchi Yang
2021-10-13
Combinatorics · Mathematics
Improved upper bound on the Frank number of $3$-edge-connected graphs
János Barát, Zoltán L. Blázsik
2023-05-31