## Analogies between Dimension and Chromatic Number

- March 20, 2015
- 2:30 p.m.
- LeConte 121

## Abstract

We discuss the relationship between the following two combinatorial parameters: chromatic number for graphs and dimension for posets. At various times over the years, I have (certainly with tongue in cheek) referred to dimension theory as "graph theory for grown-ups". In this talk, we will consider three instances where there are analogous results: (1) bounded maximum degree; (2) stability analysis near the maximum value; and (3) forcing large complete graph minors. The audience will be free to decide whether there is any substance to my off-hand remarks - even if offered in good spirits.