Connectivity properties of Hamiltonian Graphs
OTHER MATHEMATICS DEPARTMENT EVENTS: MATH TABLE
When: October 9, 2024
4:30 pm - 5:30 pm
Where: Science Center 507
Address:
1 Oxford Street, Cambridge, MA 02138, United States
Speaker: Quinn Brussel - Harvard University
Given a graph G, the “Frank number” F(G) encodes interesting connectivity properties of the graph. It is conjectured that for all cubic graphs, the Frank number is at most three. In the service of this main conjecture is the conjecture that if G is Hamiltonian and cubic, then F(G) is at most 2. In this talk we will show that this result is true.