← All problems

Contact-order distance conjecture for colored graph representations

2 years old · traced to

Let GG be a graph whose vertices are colored with zz and ww, and let ii 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 ii is twice the path distance from ii to the closest vertex colored ww. The source reports computational evidence for this extension, but does not state a proof or resolution.

References
  1. Lily Adlin, Giovani Thai, Samuel Tiscareno and Ryan Tully-Doyle, “Cauchy Transforms of Colored Graphs in Two Variables”, arXiv:2410.10695 (2025).

Progress summary

Refreshed
Open · progress reported

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 ww-colored vertex. The published source leaves the version with multiple ww-colored vertices as a conjecture.

Known results

  • Exactly one ww-colored vertex: contact order is 2n2n, where nn is the minimum path length to that vertex (Theorem 4.64.6, 2024).
  • For multiple ww-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-ww distance 11, but contact order 66, based on analytic branches of orders 66 and 22. Its linked preprint is not independently assessed here.

Current status (as of November 2026): The one-ww case is proved, while the general multi-ww 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 solutionHide 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.