Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar Talk Information |

**Date and Time**: Tuesday, November 23, 2010, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Marek Sulovský

A conflict-free coloring of a hypergraph H=(V,E) is a coloring of its vertices in such a way, that every nonempty hyperedge contains a vertex of unique color (within the heyperedge). This notion has been motivated by the frequency assignment problem (classical situation with mobile devices and antennae) and has been studied for several hypergraphs arising from geometric objects.

In this talk, we will look at the list variant of the problem. We show, that every hreditarily k-colorable hypergraph on n vertices can be conflict-free list-colored with list of size log_{1+1/k}(n)+1. Furthermore, it is possible to achieve, that the highest color (assuming some order of the colors) in every hyperedge is unique. This is already nontrivial for points and intervals in R. It for instance implies list-colorability of points w.r.t. intervals by log_2(n)+1 colors, points in R2 w.r.t. halfspaces by 1.71log_2(n)+1 colors and points in R2 w.r.t. disks by 2.41log_2(n)+1 colors.

Maybe a bit surprisingly, the result exactly (including the multiplicative constant) matches what is known for usual conflict-free coloring, although the proof for the list setting is more complicated.

Joint work with שכר סמורודינסקי and Πανοσ Χειλαρισ.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2018 2017 2016 2015 2014 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.4803M | admin login