Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, October 11, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Philipp Zumstein
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.
Automatic MiSe System Software Version 1.4803M | admin login