Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, September 23, 2014, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Jan Volec
A fractional coloring of a graph $G$ is an assignment of non-negative weights to every independent set of $G$ in such a way that for every vertex $v$ of $G$, the sum of the weights of the independent sets containing $v$ is at least one. The weight of a fractional coloring is the total sum of the weights over all independent sets, and the fractional chromatic number is the smallest number $k$ such that there exists a fractional coloring of the weight $k$. In this talk, we show that every triangle-free graph with maximum degree 3 has fractional chromatic number at most $14/5$, thus confirming a conjecture of Heckman and Thomas.
This is joint work with Zdenek Dvorak and Jean-Sebastien Sereni.
Automatic MiSe System Software Version 1.4803M | admin login