April 30, 2015
10:20AM - 11:15AM
Math Tower 154
Add to Calendar
2015-04-30 10:20:00
2015-04-30 11:15:00
Combinatorics Seminar - Deepak Bal
Title: Monochromatic cycle partitions of random graphsSpeaker: Deepak Bal (Miami University)Abstract: We say that a graph $G$ has property $\mathcal{L}$ if in every 2-coloring of the edges of $G$ there exists a red cycle and blue cycle which are vertex disjoint and which partition the vertex set of $G$. It was conjectured by Lehel that $K_n$ has property $\mathcal{L}$ and this was confirmed for large $n$ by Łuczak, Rödl, and Szemerédi and with a better value of $n$ by Allen. Bessy and Thomassé gave a proof for all $n$. In this talk we explore property $\mathcal{L}$ and an approximate version when $G\sim G(n,p)$, the Erdős–Rényi random graph. This is joint work with Louis DeBiasio.
Math Tower 154
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
Add to Calendar
2015-04-30 10:20:00
2015-04-30 11:15:00
Combinatorics Seminar - Deepak Bal
Title: Monochromatic cycle partitions of random graphsSpeaker: Deepak Bal (Miami University)Abstract: We say that a graph $G$ has property $\mathcal{L}$ if in every 2-coloring of the edges of $G$ there exists a red cycle and blue cycle which are vertex disjoint and which partition the vertex set of $G$. It was conjectured by Lehel that $K_n$ has property $\mathcal{L}$ and this was confirmed for large $n$ by Łuczak, Rödl, and Szemerédi and with a better value of $n$ by Allen. Bessy and Thomassé gave a proof for all $n$. In this talk we explore property $\mathcal{L}$ and an approximate version when $G\sim G(n,p)$, the Erdős–Rényi random graph. This is joint work with Louis DeBiasio.
Math Tower 154
Department of Mathematics
math@osu.edu
America/New_York
public
Title: Monochromatic cycle partitions of random graphs
Speaker: Deepak Bal (Miami University)
Abstract: We say that a graph $G$ has property $\mathcal{L}$ if in every 2-coloring of the edges of $G$ there exists a red cycle and blue cycle which are vertex disjoint and which partition the vertex set of $G$. It was conjectured by Lehel that $K_n$ has property $\mathcal{L}$ and this was confirmed for large $n$ by Łuczak, Rödl, and Szemerédi and with a better value of $n$ by Allen. Bessy and Thomassé gave a proof for all $n$. In this talk we explore property $\mathcal{L}$ and an approximate version when $G\sim G(n,p)$, the Erdős–Rényi random graph. This is joint work with Louis DeBiasio.
