Some remarks on Folkman graphs for triangles
Eion Mulrenin

TL;DR
This paper explores Folkman graphs related to geometric constructions, conjectures the existence of a Folkman subgraph within a specific graph, and demonstrates that certain random modifications preserve key properties.
Contribution
It introduces a sequence of geometric graphs with Folkman-like properties and provides evidence for a conjecture about a specific 63-vertex graph containing a Folkman graph.
Findings
Existence of triangle systems in $H_q$ with no $K_4$ spanning four vertices.
Verification of properties for $H_3$ through computational methods.
Random alterations of $H_q$ maintain Ramsey properties with high probability for large $q$.
Abstract
Folkman's theorem asserts the existence of graphs which are -free, but which have the property that every two-coloring of contains a monochromatic triangle. The quantitative aspects of , the least such that there exists an -vertex graph with both properties above, are notoriously difficult; a series of improvements over the span of two decades witnessed the solution to two $100 Erd\H{o}s problems, and the current record due to Lange, Radziszowski, and Xu now stands at , the proof of which is computer-assisted. In this paper, we study Folkman-like properties of a sequence of finite geometric graphs constructed using Hermitian unitals in projective planes, and conjecture that the graph , which has 63 vertices, contains a Folkman graph as a proper subgraph. As evidence towards this conjecture, we show that for all prime…
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 · Computational Geometry and Mesh Generation
