quadripartite_max_wild_number
deforiginal
The maximum wild number of the complete equipartite graph K_{n,n,n,n} over all proper edge colorings using exactly 3n colors.
Statement
noncomputable def quadripartite_max_wild_number (n : ℕ) : ℕ
- Related work
- arXiv:2610.22142
- Verified
- 29 Oct 2026
- Axioms
- none listed
- Built on 1
- simple_graph_wild_numberThe wild number wld_γ(G) of an edge-coloured graph is the minimum size of a colour-connecting set of edges.
- Used by 1
- quadripartite_max_wild_number_eq_of_boundsThe maximum wild number equals 2n + 1 as soon as every proper 3n-edge-colouring of K_{n,n,n,n} has wild number at most 2n + 1 and some…
Read back from the Lean
quadripartite_max_wild_number n is defined as the supremum (in ℕ) of the set of natural numbers k for which there exists a proper coloring c of the line graph of the complete equipartite graph with 4 parts of size n (SimpleGraph.completeEquipartiteGraph 4 n) using colors in Fin (3 * n) (i.e., a proper (3n)-edge-coloring of K_{n,n,n,n}) such that the wild number (simple_graph_wild_number) of c in that graph equals k.
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 maximum wild number over all proper (3n)-edge colorings of K_{n,n,n,n}. -/ noncomputable def quadripartite_max_wild_number (n : ℕ) : ℕ := sSup { k : ℕ | ∃ c : (SimpleGraph.completeEquipartiteGraph 4 n).lineGraph.Coloring (Fin (3 * n)), simple_graph_wild_number (SimpleGraph.completeEquipartiteGraph 4 n) c = k }