Login
Talks & Seminars
Title: Coloring H-free Hypergraphs
Prof. Dhruv Mubayi, Department of Mathematics, Statistics and Computer Science, Univ. of Illinois at Chicago.
Date & Time: December 15, 2008 11:30
Venue: CSE Seminar Hall
Abstract:
Abstract: Let H be a fixed r-uniform hypergraph. What is the minimum number of edges in an H-free r-uniform hypergraph with chromatic number at least k? Various special cases of this problem have been open for decades. We begin a systematic study of these questions, improving on several old results of other researchers. This is joint work with Tom Bohman and Alan Frieze.
Speaker Profile:
List of Talks

Webmail

Username:
Password:
Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback