Hippchen's conjecture for 5-connected graphs
Statement
Let be a 5-connected graph. 5-connected Hippchen conjecture. Every pair of longest paths intersect each other in at least five vertices. The paper proves the analogous statement for 4-connected graphs and proposes this 5-connected extension; it remains open in the source.
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.