For a hypergraph H, let q(H) denote the expected number of monochromatic edges when the color of each vertex in H is sampled uniformly at random from the set of size 2. Let smin(H) denote the minimumâ€¦ (More)

We prove that the paint number of the complete bipartite graph KN,N is logN + O(1). As a consequence, we get that the difference between the paint number and the choice number of KN,N is Î˜(log logN).â€¦ (More)

We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called k-LCIS: Given k integer sequences X1, . . . , Xk of length at most n,â€¦ (More)