16 citations · 192 across the 105 of their papers we have counts for
7 papers · 2 filters
Almost all cancellative triple systems are tripartite
Jozsef Balogh, Dhruv Mubayi
A triple system is cancellative if no three of its distinct edges satisfy . It is tripartite if it has a vertex partition into three parts such that every edge h…
Counting substructures III: quadruple systems
Dhruv Mubayi
For various quadruple systems F, we give asymptotically sharp lower bounds on the number of copies of F in a quadruple system with a prescribed number of vertices and edges. Our re…
Counting substructures I: color critical graphs
Dhruv Mubayi
Let be a graph which contains an edge whose deletion reduces its chromatic number. We prove tight bounds on the number of copies of in a graph with a prescribed number of v…
Finding bipartite subgraphs efficiently
D. Mubayi, G. Turan
Polynomial algorithms are given for the following two problems: given a graph with vertices and edges, where , find a complete balanced bipartite subgraph…
Counting substructures II: triple systems
Dhruv Mubayi
For various triple systems , we give tight lower bounds on the number of copies of in a triple system with a prescribed number of vertices and edges. These are the first suc…
Biclique Coverings and the Chromatic Number
Dhruv Mubayi, Sundar Vishwanathan
Consider a graph with chromatic number and a collection of complete bipartite graphs, or bicliques, that cover the edges of . We prove the following two results: \medski…