1.1k citations
- D. Schaile11 profiles117 · h 87
- K. Yip3 profiles115 · h 65
- A. Meyer4 profiles111 · h 142
- L. Bagby2 profiles111 · h 55
- A. Bean2 profiles110 · h 120
- E. Barberis3 profiles110 · h 118
- E. Shabalina2 profiles110 · h 94
- G. Landsberg3 profiles110 · h 119
- H. Fox4 profiles110 · h 84
- P. Baringer3 profiles110 · h 120
- A. Khanov12 profiles109 · h 94
- A. Melnitchouk10 profiles109 · h 45
- Brookhaven National LaboratoryUS144 papers
- University of WashingtonUS139 papers
- Indiana University BloomingtonUS134 papers
- Michigan State UniversityUS134 papers
- Rice UniversityUS132 papers
- University of Science and Technology of ChinaCN132 papers
- Panjab UniversityIN131 papers
- Fermi National Accelerator LaboratoryUS118 papers
- University of RochesterUS118 papers
- Joint Institute for Nuclear ResearchRU116 papers
- Northwestern UniversityUS116 papers
- University of MichiganUS116 papers
13 papers · 1 filter
An Explicit Solution to the Chessboard Pebbling Problem
Qiang Zhen, Charles Knessl
We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations and a related double sequenc…
Toward a Hajnal-Szemeredi theorem for hypergraphs
Hal Kierstead, Dhruv Mubayi
Let be a triple system with maximum degree and let . Then has a proper vertex coloring with colors such that any two color classes differ…
Almost all triple systems with independent neighborhoods are semi-bipartite
Jozsef Balogh, Dhruv Mubayi
The neighborhood of a pair of vertices in a triple system is the set of vertices such that is an edge. A triple system $\HH$ is semi-bipartite if its vertex set con…
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 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…