Sharpness of the edge-distinguishing bound for infinite locally finite star-free graphs
Statement
Let be a natural number greater than three. A connected infinite locally finite graph is a graph with infinitely many vertices, finite vertex degrees, and a path between every pair of vertices; for a graph , let denote its distinguishing index, the least number of colours in an edge colouring preserved only by the identity automorphism.
Sharpness conjecture. For every natural number greater than three there exists a connected infinite locally finite graph such that
The conjecture asks whether the upper bound for connected locally finite -free graphs is attained for every in the infinite case. The paper notes that the bound is attained for finite graphs and for infinite locally finite -free graphs, while the cases remain open.
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.