bipartite_ramsey_number
The r-colour bipartite Ramsey number br_r(H) of a simple graph H is the infimum of the set of natural numbers N such that every r-edge-colouring of K_{N,N} contains a monochromatic copy of H.
Statement
noncomputable def bipartite_ramsey_number {α : Type*} (H : SimpleGraph α) (r : ℕ) : ℕ
- Defined in
- arXiv:2610.29813
- Verified
- 22 Oct 2026
- Axioms
- none listed
- Built on 1
- bipartite_ramsey_propertyFor a simple graph H and natural numbers r and N, bipartite_ramsey_property H r N holds if every r-edge-colouring of the complete…
Read back from the Lean
The bipartite Ramsey number bipartite_ramsey_number H r of a simple graph H on vertex type α with r colors is defined as the infimum (sInf in ℕ, which is 0 if the set is empty) of the set of natural numbers N such that bipartite_ramsey_property H r N holds.
Here, bipartite_ramsey_property H r N asserts that for every coloring c of the edge set of the complete bipartite graph completeBipartiteGraph (Fin N) (Fin N) with colors in Fin r, there exists a color col : Fin r such that H is contained (SimpleGraph.IsContained) in the monochromatic subgraph of completeBipartiteGraph (Fin N) (Fin N) consisting of all edges assigned color col by c.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The r-colour bipartite Ramsey number br_r(H) of a simple graph H. -/ noncomputable def bipartite_ramsey_number {α : Type*} (H : SimpleGraph α) (r : ℕ) : ℕ := sInf {N : ℕ | bipartite_ramsey_property H r N}