Campus Event Calendar
Event Entry
What and Who
Induced Colourful Paths in Triangle-free Graphs
Mathew Francis
Indian Statistical Institute, Chennai, India
AG1 Mittagsseminar (own work)
AG 1
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 14 September 2017
13:00
30 Minutes
E1 4
024
Saarbrücken
Abstract
Given a graph G = (V, E) whose vertices have been properly coloured, we say that a path in G is colourful if no two vertices in the path have the same colour. It is a corollary of the Gallai-Roy Theorem that every properly coloured graph contains a colourful path on \chi(G) vertices, where \chi(G) is the chromatic number of G. We explore a conjecture that states that every properly coloured triangle-free graph G contains an induced colourful path on \chi(G) vertices.
Contact
Davis Issac
--email hidden
passcode not visible
logged in users only
Davis Issac, 09/06/2017 15:50 -- Created document.