6 citations · 8 across the 4 of their papers we have counts for
5 papers
Coloring sparse hypergraphs
Jeff Cooper, Dhruv Mubayi
Fix , and let be a -uniform hypergraph with maximum degree . Suppose that for each , every set of l vertices of G is in at most $Δ^{(k-l)/(k-1)…
Sparse hypergraphs with low independence number
Jeff Cooper, Dhruv Mubayi
Let K_4 denote the complete 3-uniform hypergraph on 4 vertices. Ajtai, Erdős, Komlós, and Szemerédi (1981) asked if there is a function ω(d) tending to infinity such that every 3-u…
Counting independent sets in hypergraphs
Jeff Cooper, Kunal Dutta, Dhruv Mubayi
Let be a triangle-free graph with vertices and average degree . We show that contains at least \[ e^{(1-n^{-1/12})\frac{1}{2}\frac{n}{t}\ln t (\frac{1}{2}\ln t-1)} \…
List Coloring Triangle-Free Hypergraphs
Jeff Cooper, Dhruv Mubayi
A triangle in a hypergraph is a collection of distinct vertices u,v,w and distinct edges e,f,g with u,v \in e, v,w \in f, w,u \in g, and \{u,v,w\} \cap e \cap f \cap g=\emptyset. T…
Counting independent sets in triangle-free graphs
Jeff Cooper, Dhruv Mubayi
Ajtai, Komlós, and Szemerédi proved that for sufficiently large every triangle-free graph with vertices and average degree has an independent set of size at least $\fra…