REVIEW 1 cited by
The Four-Color Ramsey Multiplicity of Triangles
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We study a generalization of a famous result of Goodman and establish that asymptotically at least a $1/256$ fraction of all triangles needs to be monochromatic in any four-coloring of the edges of a complete graph. We also show that any large enough extremal construction must be based on a blow-up of one of the two $R(3,3,3)$ Ramsey-colorings of $K_{16}$. This result is obtained through an efficient flag algebra formulation by exploiting problem-specific combinatorial symmetries that also allows us to study some related problems.
Forward citations
Cited by 1 Pith paper
-
Density of rainbow triangles and properly colored $K_4$'s
A graph with R red, G green, B blue edges contains at most ¼(RGB)^{2/3} properly colored K4s, with equality only for balanced blowups of a properly colored K4; the known rainbow-triangle bound √(2RGB) receives new fla...
Discussion (0). Continue with ORCID to comment.