Mubayi, Dhruv - Department of Mathematics, Statistics, and Computer Science, University of Illinois at Chicago

• Proof of a Conjecture of Erdos on triangles in set-systems
• Books versus Triangles Dhruv Mubayi
• ON EVEN-DEGREE SUBGRAPHS OF LINEAR HYPERGRAPHS
• Set systems with no singleton intersection Peter Keevash
• Two-regular subgraphs of hypergraphs Dhruv Mubayi
• On a two-sided Turan problem Dhruv Mubayi
• Bipartite Coverings and the Chromatic Number Dhruv Mubayi Sundar Vishwanathan
• On the VC-dimension of Uniform Hypergraphs Dhruv Mubayi
• Non-Uniform Turan-Type problems Dhruv Mubayi
• On the Turan number of Triple-Systems Dhruv Mubayi
• Counting substructures II: hypergraphs Dhruv Mubayi
• Combinatorial problems for Horn clauses Marina Langlois
• Constructions of Non-Principal Families in Extremal Hypergraph Theory
• TREE-MINIMAL GRAPHS ARE ALMOST REGULAR D. DELLAMONICA JR., P. HAXELL, T. LUCZAK, D. MUBAYI, B. NAGLE,
• Counting substructures I: color critical graphs Dhruv Mubayi
• Erdos-Ko-Rado in Random Hypergraphs Jozsef Balogh
• A new generalization of Mantel's theorem to k-graphs Dhruv Mubayi
• ON THE EDGE-BANDWIDTH OF GRAPH PRODUCTS JOZSEF BALOGH, DHRUV MUBAYI, AND ANDRAS PLUHAR
• Supersaturation for Ramsey-Turan problems Dhruv Mubayi
• Erdos-Ko-Rado for three sets Dhruv Mubayi
• The co-degree density of the Fano plane Dhruv Mubayi
• A FAMILY OF SWITCH EQUIVALENT GRAPHS BERTRAND GUENIN , DHRUV MUBAYI
• Uniform edge distribution in hypergraphs is hereditary Dhruv Mubayi
• A Hypergraph Extension Bipartite Turan Problem
• On hypergraphs with every four points spanning at most two triples
• The chromatic spectrum of mixed hypergraphs , Dhruv Mubayi
• New lower bounds for Ramsey numbers of graphs and hypergraphs Felix Lazebnik
• Coloring simple hypergraphs Alan Frieze
• The DNF Exception Problem Dhruv Mubayi
• Set systems without a simplex or a cluster Peter Keevash
• ON THE INDEPENDENCE NUMBER OF THE ERDOS-RENYI AND PROJECTIVE NORM GRAPHS AND A RELATED
• New lower bounds for the independence number of sparse graphs and hypergraphs
• Simplex stability Dhruv Mubayi
• Almost all triple systems with independent neighborhoods are semi-bipartite
• An intersection theorem for four sets Dhruv Mubayi
• TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
• On the chromatic number of simple triangle-free triple Alan Frieze
• Almost all cancellative triple systems are tripartite Jozsef Balogh
• Stability theorems for cancellative hypergraphs Peter Keevash
• Extremal problems for t-partite and t-colorable hypergraphs
• Explicit constructions of triple systems for Ramsey-Turan problems
• Quadruple Systems with Independent Neighborhoods Zoltan Furedi
• Constructions of bipartite graphs from finite geometries
• On the chromatic number and independence number of hypergraph products
• A hypergraph extension of Turan's theorem Dhruv Mubayi
• Some exact results and new asymptotics for hypergraph Turan numbers
• Specified intersections Dhruv Mubayi
• On the Chromatic Thresholds of Hypergraphs Jozsef Balogh
• Multicolor Ramsey Numbers for Complete Bipartite Versus Complete Graphs