DeepAI AI Chat
Log In Sign Up

A spectral bound on hypergraph discrepancy

by   Aditya Potukuchi, et al.
Rutgers University

Let H be a t-regular hypergraph on n vertices and m edges. Let M be the m × n incidence matrix of H and let us denote λ =_v ∈1^1/√(t)vMv. We show that the discrepancy of H is O(√(λ t)). As a corollary, this gives us that for every t, the discrepancy of a random t-regular hypergraph with n vertices and m ≥ n edges is almost surely O(√(t)) as n grows. The proof also gives a polynomial time algorithm that takes a hypergraph as input and outputs a coloring with the above guarantee.


page 1

page 2

page 3

page 4


A generalization of the Kővári-Sós-Turán theorem

We present a new proof of the Kővári-Sós-Turán theorem that ex(n, K_s,t)...

A note on two-colorability of nonuniform hypergraphs

For a hypergraph H, let q(H) denote the expected number of monochromatic...

Discrepancy in random hypergraph models

We study hypergraph discrepancy in two closely related random models of ...

The Phase Transition of Discrepancy in Random Hypergraphs

Motivated by the Beck-Fiala conjecture, we study the discrepancy problem...

On Pseudo-disk Hypergraphs

Let F be a family of pseudo-disks in the plane, and P be a finite subset...

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3

In the Maker-Breaker positional game, Maker and Breaker take turns picki...

Recurrently Predicting Hypergraphs

This work considers predicting the relational structure of a hypergraph ...