MATH Seminar
| Title: Some problems in Anti-Ramsey Theory |
|---|
| Seminar: Combinatorics |
| Speaker: Sogol Jahanbekam of The University of Colorado, Denver |
| Contact: Dwight Duffus, dwight@mathcs.emory.edu |
| Date: 2013-11-01 at 4:00PM |
| Venue: W306 |
| Download Flyer |
| Abstract: In this talk we introduce some new lower bounds for the matching number of bipartite graphs and general graphs. We apply these results to Anti-Ramsey numbers of some families of graphs including disjoint spanning disjoint spanning cycles, disjoint perfect matchings, and graphs with bounded diameter. |
See All Seminars