David Conlon
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 1%
- Advanced Topology and Set Theory
- Graph theory and applications
Papers in
-
- Limits and Structures in Graph Theory 59
-
- Advanced Graph Theory Research 47
- Graph Labeling and Dimension Problems 12
- Computability, Logic, AI Algorithms 6
- Complexity and Algorithms in Graphs 6
- Co-authors
- Jacob Fox (34 shared papers)Benny Sudakov (22 shared papers)W. T. Gowers (2 shared papers)Yufei Zhao (7 shared papers)Mathias Schacht (3 shared papers)Choongbum Lee (4 shared papers)Hiệp Hàn (2 shared papers)Wojciech Samotij (1 shared paper)
- Journals
- Random Structures and Algorithms (6 papers)COMBINATORICA (6 papers)Combinatorics Probability Computing (4 papers)Bulletin of the London Mathematical Society (4 papers)Journal of Combinatorial Theory Series B (3 papers)
- Partner nations
- United StatesUnited KingdomSwitzerland
In The Last Decade
David Conlon
56 papers receiving 768 citations
Peers
Comparison fields: 5 of 29
- Discrete Mathematics and Combinatorics 720
- Geometry and Topology 509
- Computational Theory and Mathematics 664
- Algebra and Number Theory 43
- Computer Graphics and Computer-Aided Design 30
Countries citing papers authored by David Conlon
This map shows the geographic impact of David Conlon'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 David Conlon with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Conlon more than expected).
Fields of papers citing papers by David Conlon
This network shows the impact of papers produced by David Conlon. 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 David Conlon. The network helps show where David Conlon may publish in the future.
Co-authors
The 25 scholars most cited alongside David Conlon, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 67 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 73 | |
| 2 | 2016 | 63 | |
| 3 | 2013 | 60 | |
| 4 | 2010 | 48 | |
| 5 | 2009 | 45 | |
| 6 | 2012 | 38 | |
| 7 | 2014 | 31 | |
| 8 | 2016 | 28 | |
| 9 | 2011 | 27 | |
| 10 | 2010 | 24 | |
| 11 | 2015 | 24 | |
| 12 | 2014 | 23 | |
| 13 | 2010 | 21 | |
| 14 | 2012 | 21 | |
| 15 | 2009 | 20 | |
| 16 | 2008 | 19 | |
| 17 | 2008 | 19 | |
| 18 | 2014 | 18 | |
| 19 | 2019 | 17 | |
| 20 | 2009 | 16 |
About David Conlon
David Conlon is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Mathematical Physics and Computer Graphics and Computer-Aided Design, having authored 67 papers that have together received 822 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (59 papers), Advanced Graph Theory Research (47 papers), Advanced Topology and Set Theory (32 papers), Graph theory and applications (14 papers), Graph Labeling and Dimension Problems (12 papers), Computability, Logic, AI Algorithms (6 papers), Complexity and Algorithms in Graphs (6 papers) and Mathematical Dynamics and Fractals (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (720 citations), Geometry and Topology (509 citations), Computational Theory and Mathematics (664 citations), Algebra and Number Theory (43 citations) and Computer Graphics and Computer-Aided Design (30 citations). David Conlon has collaborated with scholars based in United States, United Kingdom and Switzerland. Frequent co-authors include Jacob Fox, Benny Sudakov, W. T. Gowers, Yufei Zhao, Mathias Schacht, Choongbum Lee, Hiệp Hàn, Wojciech Samotij, Yury Person and Shalosh B. Ekhad. Their work appears in journals such as Random Structures and Algorithms, COMBINATORICA, Combinatorics Probability Computing, Bulletin of the London Mathematical Society and Journal of Combinatorial Theory Series B.
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.