Dhruv Mubayi
-
- Limits and Structures in Graph Theory 118
- Geometry and Topology top 1%
- Advanced Topology and Set Theory 44
- Graph theory and applications 32
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 103
- Graph Labeling and Dimension Problems 18
- Computational Mathematics top 10%
-
- Computational Geometry and Mesh Generation 5
-
- graph theory and CDMA systems 32
-
- Interconnection Networks and Systems 5
- Co-authors
- Jacques VerstraëteAlexandr KostochkaPeter KeevashVojtěch RödlTao JiangZoltán FürediYi ZhaoDouglas B. West
- Cited by
- Discrete Mathematics and CombinatoricsGeometry and TopologyComputational Theory and Mathematics
- Journals
- Journal of Combinatorial Theory Series B (16 papers)Journal of Graph Theory (15 papers)Combinatorics Probability Computing (13 papers)
- Partner nations
- United StatesHungaryGermany
In The Last Decade
Dhruv Mubayi
124 papers receiving 1.1k citations
Peers
Comparison fields: 5 of 39
- Discrete Mathematics and Combinatorics 1.0k
- Geometry and Topology 632
- Computational Theory and Mathematics 931
- Computational Mathematics 13
- Computer Graphics and Computer-Aided Design 28
Countries citing papers authored by Dhruv Mubayi
This map shows the geographic impact of Dhruv Mubayi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Dhruv Mubayi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dhruv Mubayi more than expected).
Fields of papers citing papers by Dhruv Mubayi
This network shows the impact of papers produced by Dhruv Mubayi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Dhruv Mubayi. The network helps show where Dhruv Mubayi may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Dhruv Mubayi, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2025 | 0 | |
| 2 | 2025 | 0 | |
| 3 | 2025 | 0 | |
| 4 | 2024 | 0 | |
| 5 | 2023 | 0 | |
| 6 | A survey of quantitative bounds for hypergraph Ramsey problems | 2017 | 2 |
| 7 | 2016 | 6 | |
| 8 | 2016 | 14 | |
| 9 | 2014 | 7 | |
| 10 | 2013 | 5 | |
| 11 | 2013 | 17 | |
| 12 | 2013 | 8 | |
| 13 | 2009 | 14 | |
| 14 | 2007 | 18 | |
| 15 | 2005 | 60 | |
| 16 | 2005 | 16 | |
| 17 | 2004 | 17 | |
| 18 | 2002 | 13 | |
| 19 | 2002 | 6 | |
| 20 | 2001 | 5 |
About Dhruv Mubayi
Dhruv Mubayi is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics, having authored 135 papers that have together received 1.2k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (118 papers), Advanced Graph Theory Research (103 papers), Advanced Topology and Set Theory (44 papers), graph theory and CDMA systems (32 papers), Graph theory and applications (32 papers), Graph Labeling and Dimension Problems (18 papers), Interconnection Networks and Systems (5 papers) and Computational Geometry and Mesh Generation (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.0k citations), Geometry and Topology (632 citations) and Computational Theory and Mathematics (931 citations). Dhruv Mubayi has collaborated with scholars based in United States, Hungary and Germany. Frequent co-authors include Jacques Verstraëte, Alexandr Kostochka, Peter Keevash, Vojtěch Rödl, Tao Jiang, Zoltán Füredi, Yi Zhao, Douglas B. West, Oleg Pikhurko and Alan Frieze. Their work appears in journals such as Journal of Combinatorial Theory Series B, Journal of Graph Theory, Combinatorics Probability Computing, Journal of Combinatorial Theory Series A and COMBINATORICA.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.