Havet–Horsch–Rambaud inversion-diameter conjecture
Statement
Let be a graph. Write for its inversion graph and for its inversion diameter, and let denote the maximum degree of .
Havet–Horsch–Rambaud's conjecture. For every graph ,
Havet, Horsch and Rambaud proved the weaker general bound and established the conjectured bound for graphs with maximum degree at most two. The conjecture is also known for several further graph classes, but its status in general is unresolved.
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.