Coroničová Hurajová–Gago–Madaras blow-up conjecture for betweenness-uniform graphs
Statement
Let be a graph on vertex set , and let denote the graph obtained by replacing each vertex with a graph and adding all edges prescribed by the edges of . A graph is betweenness-uniform when all its vertices have the same betweenness.
Coroničová Hurajová–Gago–Madaras conjecture. For any graph on a vertex set there exist graphs such that is betweenness-uniform.
The conjecture proposes that every graph admits a suitable blow-up yielding a betweenness-uniform graph. The supplied text does not state whether it has been resolved.
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.