didericis 2ae729db1e Refute plane diamond coloring conjecture with 16-vertex counterexample ...

Adds Theorem 2.6 stating Conjecture 2.5 is false, with proof exhibiting
a 16-vertex maximal planar graph (graph6 O???IAGKEBEQQYHdplW{n) for
which the auxiliary 4-colorability check fails at every root vertex,
verified computationally via Sage's chromatic_number. Includes the
graph as a figure and adds a McKay graph6 reference.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>

2026-05-09 12:40:42 -04:00

..

colored_pentagon_contractions

Move paper directories into papers/

2026-04-21 21:19:16 -04:00

kempe_proof_fixed

Move paper directories into papers/

2026-04-21 21:19:16 -04:00

kempe_style_search_for_smaller_contradiction

Move paper directories into papers/

2026-04-21 21:19:16 -04:00

plane_depth_sequencing

Simplify d=0 case in outerplanar lemma proof

2026-04-25 05:22:25 -04:00

plane_diamond_coloring

Refute plane diamond coloring conjecture with 16-vertex counterexample

2026-05-09 12:40:42 -04:00