Upper bound on the edge Folkman number $F_e(3,3,3;13)$
Nikolay Kolev

TL;DR
This paper establishes an upper bound for the edge Folkman number F_e(3,3,3;13), a combinatorial constant in Ramsey theory, advancing understanding of these numbers.
Contribution
It provides the first known upper bound for F_e(3,3,3;13), contributing new insights into edge Folkman numbers in Ramsey theory.
Findings
Derived an explicit upper bound for F_e(3,3,3;13)
Enhanced understanding of bounds in Ramsey theory
Contributed to the study of combinatorial constants
Abstract
In this paper we discuss a class of combinatorial constants in Ramsey theory- edge Folkman numbers. We give an upper bound on one of them- the number F_e(3,3,3;13).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · graph theory and CDMA systems
