New Upper Bound for the Edge Folkman Number Fe(3,5;13)
Nikolay Kolev
TL;DR
This paper establishes a new upper bound of 21 for the edge Folkman number Fe(3,5;13), advancing understanding of edge-coloring properties in graph theory.
Contribution
The paper provides the first proven upper bound for Fe(3,5;13), improving previous bounds and contributing to the study of Folkman numbers.
Findings
Fe(3,5;13) ≤ 21
Improved bounds on edge Folkman numbers
Advancement in graph coloring theory
Abstract
In this paper we prove that the edge Folkman number Fe(3,5;13) is not greater than 21.
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
TopicsAnalytic Number Theory Research · Algebraic Geometry and Number Theory