Mathematics The University of Queensland Homepage

MATHEMATICS COLLOQUIUM

Tuesday 18 November 2008, 2pm 67-141

Wal Wallis, Southern Illinois University Carbondale

Triangle-free regular graphs

Abstract
By a triangle in a graph we mean a subgraph K3, that is, a set of three mutually adjacent vertices. We shall address the following problem: For what values of d and n does there exist a regular graph of degree d, on n vertices, that contains no triangle?

All welcome.


http://www.maths.uq.edu.au/cdmc/Seminars.html