Supervisors:
听
Working Thesis:听
Intersections of three longest paths in connected graphs.
听
In the 1980s, Zamfirescu听asked the question of whether every set of three longest paths of a connected graph intersect. It has been conjectured that the answer to this question is affirmative. For a number of classes of graphs, this conjecture is known to be true, but it has not been proved to be true in general. This project intends to expand on the classes for which this conjecture is known to hold, in particular surrounding the classes of chordal graphs and P5-free graphs.
听
Research interests:
Graph theory, applications of physical craft to mathematics.
听
Academic history:
Bachelor of Science in Mathematics, 成人大片
Master of Mathematical Sciences with Distinction (endorsed in Mathematics), 成人大片
