Chromatic and List-Chromatic Numbers of Infinite Hypergrahs

Suppose there are a number of committees of people, which we represent by vertices of a graph and draw an edge between two vertices if those committees share a common member. Then the list-colouring number is (informally) the minimum number k so that as long as each committee comes up with a list of k-many timeslots during which they can meet, we are guaranteed to be able to schedule all of the meetings without conflict. More formall, we say the list-chromatic number of a graph is the least cardinal ? such that for every assignment of lists of colours to vertices v of the graph such that |L(v)| <= ? there is a proper colouring that assigns to every vertex v a colour in L(v). TO BE CONT'D

Faculty Supervisor:

Brendan S Gillon

Student:

Partner:

Ben-Gurion University of the Negev

Discipline:

Mathematics

Sector:

Education

University:

McGill University

Program: