Contact-order distance conjecture for colored graph representations
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.