• Start Date: December 5, 2018
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Cole Franks - Rutgers University
  • Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
  • Presentation Type: Stand Alone Presentation
  • Abstract:

    The discrepancy of a red-blue coloring of the vertices of a hypergraph is the maximum imbalance between the number of red and blue vertices in any edge. The discrepancy of a hypergraph is the least discrepancy of any red-blue coloring. A major open question is whether the discrepancy of a t-regular hypergraph is O(\sqrt{t}). I will discuss some recent joint work with Michael Saks concerning the discrepancy of random regular hypergraphs.