General Mathematics Colloquium
Speaker: Ross Kang (IMAPP, Radboud University Nijmegen)
Title: A stronger version of the Erdős-Nešetřil conjecture
A basic question in graph theory asks for the best way to partition a graph's edges so that each part induces a matching. This stronger type of edge-colouring is the main subject of a notorious extremal problem/conjecture from the 1980s due to Erdős and Nešetřil. I will describe a failed attempt to make this more difficult.
This is recent joint work with de Joannis de Verclos and Pastor, and with Cames van Batenburg.
Location: KdVI meeting room, Science Park 107, room F3.20
Science Park 107
Science Park 107 | 1098 XG AmsterdamGo to detailpage