|Mittagsseminar Talk Information|
Date and Time: Thursday, October 11, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Philipp Zumstein
On the Minimum Degree of Ramsey Minimal Graphs
A graph G is called H-Ramsey if in every edge-coloring of G
with colors red and blue there is a monochromatic copy of H.
Furthermore, if every proper subgraph G' of G is not H-Ramsey, then we
say that G is H-minimal. We are interested in the minimum of the minimum
degree over all H-minimal graphs and denote this parameter with s(H).
We will calculate s(H) for all H from a big class of bipartite graphs
including paths, even cycles, regular connected bipartite graphs, and
trees. Another question we answer is how big can s(H) be for H a graph
with minimum degree equal to 1.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.3392 | admin login