Contact-order distance conjecture for colored graph representations
Let be a graph whose vertices are colored with and , and let be a vertex from which the representation is computed. The contact order is the order describing how the associated level curves approach one another near a boundary singularity. Contact-order distance conjecture. The contact order of the representation computed from vertex is twice the path distance from to the closest vertex colored . The source reports computational evidence for this extension, but does not state a proof or resolution.
References
- Lily Adlin, Giovani Thai, Samuel Tiscareno and Ryan Tully-Doyle, “Cauchy Transforms of Colored Graphs in Two Variables”, arXiv:2410.10695 (2025).
Progress summary
A reader-submitted five-vertex example claims to disprove the multi-color version, but the published paper only proves the one-color case.
The conjecture says that contact order equals twice the distance to the nearest -colored vertex. The published source leaves the version with multiple -colored vertices as a conjecture.
Known results
- Exactly one -colored vertex: contact order is , where is the minimum path length to that vertex (Theorem , 2024).
- For multiple -colored vertices, the source reports computational evidence but no proof; handling multiple analytic branches is identified as the main difficulty.
Community submission (unverified)
Posted November 7, 2026. A submitted argument claims a five-vertex counterexample: nearest- distance , but contact order , based on analytic branches of orders and . Its linked preprint is not independently assessed here.
Current status (as of November 2026): The one- case is proved, while the general multi- conjecture remains open; a submitted counterexample is unverified.
Sources
Solutions 1
A five-vertex counterexample to the nearest-colour contact-order conjecture for two-variable Cauchy transforms of coloured graphsSee full solution
Result and scope. Tully-Doyle, Adlin, Thai and Tiscareno, Cauchy transforms of colored graphs in two variables, arXiv:2410.10695 (v1 2024, v2 2025), Conjecture 6.1: the contact order at the boundary point corresponding to (infinity, 0) equals twice the distance from the root to the nearest w-coloured vertex. False: the five-vertex graph with edges 01,02,03,13,24,34, root 0 and w-vertices 1,2 has nearest-w distance 1 but contact order 6 (analytic branches of exact orders 6 and 2; local maximum-branch convention of the source and of Bickel-Hong).
Complete proof: A five-vertex counterexample to the nearest-colour contact-order conjecture for two-variable Cauchy transforms of coloured graphs · PDF.
The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.
This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.