MATH Seminar
| Title: On generalized Folkman numbers |
|---|
| Seminar: Combinatorics |
| Speaker: Andrzej Dudek of Carnegie Mellon University |
| Contact: Vojtech Rodl, rodl@mathcs.emory.edu |
| Date: 2010-04-16 at 4:00PM |
| Venue: MSC W301 |
| Download Flyer |
| Abstract: Extending the previous results on Folkman numbers for cliques we are interested in the following generalization. For a given graph G and a number of colors r let F(G,r) be the order of the smallest graph H such that the clique number of H equals the clique number of G and any r-coloring of the vertices of H yields a monochromatic and induced copy of G. In this talk we give a relatively small upper bound on F(G,r) as a function of the order of G and its clique number. |
See All Seminars