ON SOME CONJECTURES AND THEOREMS ABOUT COLOURING GRAPHS
Professor Anthony Hilton, Department of Mathematics, University of Reading

Abstract: An old conjecture dating from the 1950's or earlier is that a regular graph G of even order 2n and high degree d(G)>n is 1-factorizable (ie is the union of d(G) edge-disjoint spanning subgraphs of degree 1). I shall discuss current good progress being made on this conjecture, together with the relationship with two other well-known conjectures, the Overfull Conjecture and the Conformability Conjecture.

This seminar was held at the Department of Computer Science, Royal Holloway, University of London on 23 January 2001.

back