Presentation
Some problems in Anti-Ramsey Theory
Emory University Combinatorics Seminar
(2013)
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.
This is joint work with Douglas West.
Disciplines
Publication Date
November 1, 2013
Location
Atlanta, GA
Citation Information
Sogol Jahanbekam. "Some problems in Anti-Ramsey Theory" Emory University Combinatorics Seminar (2013) Available at: http://works.bepress.com/sogol-jahanbekam/30/