Dhruv Mubayi
Computational Theory and Mathematics · 2007–2016
A researcher in the Science corpus: 5 papers; trusts 10 researchers and is trusted by 4 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 11 citations into it; #11,664 of 12,182 by trust here, #10,349 by citations
- Discrete Mathematics and Combinatorics — 8 citations into it; #1,421 of 2,017 by trust here, #1,382 by citations
- Geometry and Topology — 7 citations into it
Whom Dhruv Mubayi trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- William T. Gowers
- Alan M. Frieze
- Béla Bollobás
- Michael Krivelevich
- Jie Han
- Joshua N. Cooper
- Benny Sudakov
- Yoshiharu Kohayakawa
- Aaron Dutle
Who trusts Dhruv Mubayi overall
Papers from Dhruv Mubayi's perspective
Ordered by how strongly the researchers Dhruv Mubayi trusts endorse each paper. Same corpus, a different order for every researcher.
- The Probabilistic Method
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Pseudo-random Graphs
- A combinatorial problem in geometry
- Expander Graphs and their Applications
- Random Graphs: Notation
- Random graphs
- Graph Theory (Graduate Texts in Mathematics)
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family
- Spectra of Uniform Hypergraphs
Their papers
- The structure of large intersecting families (2016) — 47 citations
- A survey of Turan problems for expansions (2016) — 70 citations
- EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS (2012) — 50 citations
- Counting substructures I: color critical graphs (2009) — 53 citations
- On the independence number of the Erdos-Rényi and projective norm graphs and a related hypergraph (2007) — 57 citations