Commit 2024-05-07 07:06 35c93d93
View on Github →feat: Construct a tripartite graph from its triangles (#12570) Both the lower bound of the Ruzsa-Szemerédi problem and the proof of the corners theorem define an auxiliary tripartite graph by specifying its triangles and showing that there are no more. This PR provides the boilerplate for this construction. It greatly simplifies both proofs.