The Structure of Clawfree Graphs

Document Type

Presentation Abstract

Presentation Date

9-10-2004

Abstract

A graphis said to be clawfree if it has no induced subgraph isomorphic to K1, 3. Line graphs are one well-known class of clawfree graphs, but there others, such as circular arc graphs and subgraphs of the Schläfli graph. It has been an open question to describe the structure of all clawfree graphs. Recently, in joint work with Paul Seymour, we were able to prove that all clawfree graphs can be constructed from basic pieces (which include the graphs mentioned above, as well as a few other ones) by gluing them together in prescribed ways. In this talk we will survey some ideas of the proof, and present examples of clawfree graphs that turned out to be of importance in the description of the general structure. We will also describe some new properties of clawfree graphs that we learned while working on the subject.

Additional Details

This talk is part of The Big Sky Conference, and is sponsored in part by the National Science Foundation & the Department of Mathematical Sciences.

Friday, 10 September 2004
4:10 p.m. in Skaggs 117
Refreshments at 3:30 p.m. in Lobby

This document is currently not available here.

Share

COinS