Here is a 3-paragraph summary of the blog post:
Researchers have proved a conjecture originally proposed by the blog's author alongside Mohammed Aljohani and John Bamberg. The conjecture concerns vertex-transitive graphs, which are highly symmetric graphs where every vertex looks structurally identical to every other. A basic counting argument establishes that in any such graph, the product of the clique number and the independence number is at most the total number of vertices in the graph.
The clique number measures the size of the largest complete subgraph (a set of vertices all connected to one another), while the independence number measures the largest set of vertices with no connections between them. These two values capture opposite extremes of the graph's structure, making their relationship a natural and interesting area of study. The conjecture likely proposed a sharper or more specific bound on this product under certain conditions.
The proof marks a satisfying resolution to a problem the authors had been sitting with for some time. While the title playfully references the famous unsolved ABC conjecture in number theory, this result is a concrete and completed achievement in graph theory. It is a nice example of how elegant structural properties of symmetric objects can lead to clean and provable mathematical statements.