https://www.openproblemgarden.org/op/do_any_three_longest_paths_in_a_connected_graph_have_a_vertex_in_common Comments for "Do any three longest paths in a connected graph have a vertex in common? " en https://www.openproblemgarden.org/op/do_any_three_longest_paths_in_a_connected_graph_have_a_vertex_in_common#comment-93705 <p>Possible solution to this appears in https://arxiv.org/abs/2006.16245 </p> <p>(I am not sure whether it is being in a referee process or whether somebody may have found a gap in the presented proof.) </p> Sat, 14 Oct 2023 12:13:51 +0200 Robert Samal comment 93705 at https://www.openproblemgarden.org https://www.openproblemgarden.org/op/do_any_three_longest_paths_in_a_connected_graph_have_a_vertex_in_common <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/gallai_tibor">Gallai</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Conjecture</b>&nbsp;&nbsp; Do any three longest paths in a connected graph have a vertex in common? </div> </tr></td> </table> </td> </tr> </table> Gallai, Tibor Graph Theory https://www.openproblemgarden.org/op/do_any_three_longest_paths_in_a_connected_graph_have_a_vertex_in_common#comment Sun, 03 Mar 2013 06:32:36 +0100 fhavet 46538 at https://www.openproblemgarden.org