MATH Seminar

Title: Subgraphs of large degree and large girth in graphs and digraphs
Seminar: Combinatorics
Speaker: Daniel Martin of Universidade Federal do ABC
Contact: Dwight Duffus, dwight@mathcs.emory.edu
Date: 2011-04-01 at 4:00PM
Venue: W306
Download Flyer
Abstract:
In 1983 Carsten Thomassen conjectured that for all positive integers $k$ and $g$ there exists $d$ such that all graphs with average degree at least $d$ contain a subgraph of average degree at least $k$ and girth at least $g$. In this talk we discuss what is known about this problem and its relationship with other problems. We also give a proof that the analogous problem for directed graphs has an affirmative answer.

See All Seminars