Coloring triangles in graphs
Ayush Basu, Vojt\v{e}ch R\"odl, Marcelo Sales

TL;DR
This paper investigates the minimal size of graphs that enforce monochromatic triangles in any 2-coloring, focusing on specific graph classes and their associated Ramsey numbers.
Contribution
It introduces and analyzes the Ramsey number for induced monochromatic triangles, providing bounds for particular classes of graphs.
Findings
Established bounds for $R_{ind}^{ riangle}(F)$ for certain graph classes.
Demonstrated tower-type bounds exist for these Ramsey numbers.
Provided new insights into the structure of graphs with monochromatic triangle properties.
Abstract
We study quantitative aspects of the following fact: For every graph , there exists a graph with the property that any -coloring of the triangles of yields an induced copy of , in which all triangles are monochromatic. We define the Ramsey number as the smallest size of such a graph . Although this fact has several proofs, all of them provide tower-type bounds. We study the number for some particular classes of graphs .
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
TopicsAdvanced Graph Theory Research
