No four-label edge coloring of K5 distinguishes all triangles by color sets
Abstract
Every map E(K5)->Fin 4 has two distinct triangles with equal edge-color sets; refutes Pilsniak-Wozniak arXiv:2407.19050v1 Conjecture 5 (tau_s(n)=n-1 for all n>=4) at n=5. Multiset Conjecture 4 untouched.
AI-assisted research preprint. The scoped main statement has a Lean certificate; internal AI review is not external journal peer review. Bounded prior-art searches do not certify worldwide priority. See the paper for qualifications and supplementary results not covered by Lean.
Supplementary files
Comments
Submitted by Myeongjin Kang. Original AI-assisted research draft and source proof package; draft preparation and internal campaign-status language in the PDF records its preparation stage. Related MathDB problem 364095. Scope: Every map E(K5)->Fin 4 has two distinct triangles with equal edge-color sets; refutes Pilsniak-Wozniak arXiv:2407.19050v1 Conjecture 5 (tau_s(n)=n-1 for all n>=4) at n=5. Multiset Conjecture 4 untouched. Attachments: proof-sources.json preserves UTF-8 source files from the accepted proof archive; extract_sources.py reconstructs them. The original archive SHA-256 is recorded in the JSON.