Atlas Mathematical Conference Abstracts || Conferences | Abstracts | for Organizers | About AMCA

Horizons in Combinatorics/16th Shanks Lecture Series
May 21-24, 2001
Vanderbilt University
Nashville, TN, USA

Organizers
Paul Edelman, Mark Ellingham, Jonathan Farley, Mike Plummer, Jerry Spinrad

View Abstracts
Conference Homepage

On the divisibility of graphs and intersection graphs
by
Chính T. Hoàng
Wilfrid Laurier University

A graph G is k-divisible if for each induced subgraph H of G with at least one edge there is a partition of the vertex set of H into sets V1, ¼, Vk such that no Vi contains a maximum clique of H. The chromatic number of a graph is bounded in terms of its clique number and its divisibility number (ie. the smallest k such that the graph is k-divisible). We shall study the divisibility of graphs that are intersection graphs of combinatorial objects.

Date received: April 20, 2001

Copyright © 2001 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Mathematical Conference Abstracts. Document # cags-62.