MATH Seminar
| Title: On Folkman-type problems |
|---|
| Seminar: Combinatorics |
| Speaker: Andrzej Dudek of Western Michigan University |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2012-11-09 at 4:00PM |
| Venue: MSC W303 |
| Download Flyer |
| Abstract: A classical Ramsey theorem states that in any 2-coloring of the edges of a sufficiently large complete graph, one will always find a monochromatic complete subgraph. In 1970, Folkman extended this result showing that for any graph $G$ there exists a graph $H$ with the same clique number as $G$ such that any 2-coloring of the edges of $H$ yields a monochromatic copy of $G$. In this talk, we present some old and recent developments concerning Folkman-type results. |
See All Seminars