Project-declaredLean 4.33.0-rc1
Infinite graph ramsey
Cslib.infinite_graph_ramsey
Plain-language statement
If the edges of an infinite complete graph is assigned a finite number of colors, then there must exist a color c and an infinite set s of vertices such that the edge between any two vertices of s is assigned the same color c.
computer sciencecomputabilityprogram semantics
Source project: Lean Computer Science Library
Person-level attribution pending.