David Conlon

2.0k total citations
64 papers, 723 citations indexed

About

David Conlon is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, David Conlon has authored 64 papers receiving a total of 723 indexed citations (citations by other indexed papers that have themselves been cited), including 57 papers in Discrete Mathematics and Combinatorics, 57 papers in Computational Theory and Mathematics and 45 papers in Geometry and Topology. Recurrent topics in David Conlon's work include Limits and Structures in Graph Theory (57 papers), Advanced Graph Theory Research (46 papers) and Advanced Topology and Set Theory (32 papers). David Conlon is often cited by papers focused on Limits and Structures in Graph Theory (57 papers), Advanced Graph Theory Research (46 papers) and Advanced Topology and Set Theory (32 papers). David Conlon collaborates with scholars based in United States, United Kingdom and Switzerland. David Conlon's 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 Jan van den Heuvel and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and Annals of Mathematics.

In The Last Decade

David Conlon

53 papers receiving 673 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
David Conlon United States	18	638	589	457	59	35	64	723
Penny Haxell Canada	17	617 1.0×	701 1.2×	319 0.7×	132 2.2×	12 0.3×	62	803
Jozef Skokan United States	13	429 0.7×	376 0.6×	274 0.6×	68 1.2×	23 0.7×	32	476
Péter Komjáth Hungary	12	222 0.3×	304 0.5×	274 0.6×	40 0.7×	36 1.0×	92	438
Norbert Sauer Canada	10	226 0.4×	346 0.6×	174 0.4×	81 1.4×	18 0.5×	30	406
Jarosław Grytczuk Poland	13	276 0.4×	515 0.9×	114 0.2×	124 2.1×	9 0.3×	52	549
Tomáš Kaiser Czechia	12	194 0.3×	348 0.6×	109 0.2×	73 1.2×	26 0.7×	60	404
L. Pyber Hungary	13	366 0.6×	267 0.5×	145 0.3×	147 2.5×	27 0.8×	27	450
Michael Stiebitz Germany	14	366 0.6×	504 0.9×	150 0.3×	79 1.3×	5 0.1×	51	555
Florian Pfender United States	12	231 0.4×	509 0.9×	203 0.4×	220 3.7×	8 0.2×	46	586
Ilya D. Shkredov Russia	13	458 0.7×	162 0.3×	202 0.4×	89 1.5×	169 4.8×	93	533

Countries citing papers authored by David Conlon

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of David Conlon

This figure shows the co-authorship network connecting the top 25 collaborators of David Conlon. A scholar is included among the top collaborators of David Conlon based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with David Conlon. David Conlon is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Conlon, David, Jacob Fox, Xiaoyu He, et al.. (2025). On Off-Diagonal Hypergraph Ramsey Numbers. International Mathematics Research Notices. 2025(11).

Conlon, David, et al.. (2024). Domination inequalities and dominating graphs. Mathematical Proceedings of the Cambridge Philosophical Society. 177(1). 167–184.

Conlon, David, et al.. (2024). Set-Coloring Ramsey Numbers via Codes. Studia Scientiarum Mathematicarum Hungarica. 61(1). 1–15.

Conlon, David, et al.. (2024). Hypergraphs Accumulate. International Mathematics Research Notices. 2025(2).

Conlon, David, et al.. (2023). Three Early Problems on Size Ramsey Numbers. COMBINATORICA. 43(4). 743–768. 1 indexed citations

Conlon, David, et al.. (2023). Set-Coloring Ramsey Numbers and Error-Correcting Codes Near the Zero-Rate Threshold. IEEE Transactions on Information Theory. 70(6). 4074–4078.

Conlon, David, et al.. (2023). Off-diagonal book Ramsey numbers. Combinatorics Probability Computing. 32(3). 516–545. 3 indexed citations

Conlon, David, et al.. (2023). On the size-Ramsey number of grids. Combinatorics Probability Computing. 32(6). 874–880.

Conlon, David, et al.. (2022). Threshold Ramsey multiplicity for paths and even cycles. European Journal of Combinatorics. 107. 103612–103612. 2 indexed citations

10.

Conlon, David, Jacob Fox, Benny Sudakov, & Yufei Zhao. (2022). Which graphs can be counted in $C_4$-free graphs?. Pure and Applied Mathematics Quarterly. 18(6). 2413–2432. 1 indexed citations

11.

Conlon, David, et al.. (2021). Repeated Patterns in Proper Colorings. SIAM Journal on Discrete Mathematics. 35(3). 2249–2264. 4 indexed citations

12.

Conlon, David, et al.. (2017). Quasirandom Cayley graphs. SHILAP Revista de lepidopterología. 3 indexed citations

13.

Conlon, David, Jacob Fox, Choongbum Lee, & Benny Sudakov. (2016). Ordered Ramsey numbers. Journal of Combinatorial Theory Series B. 122. 353–383. 20 indexed citations

14.

Conlon, David & W. T. Gowers. (2016). Combinatorial theorems in sparse random sets. Annals of Mathematics. 184(2). 367–454. 54 indexed citations

15.

Conlon, David, Jacob Fox, & Yufei Zhao. (2014). Extremal results in sparse pseudorandom graphs. Advances in Mathematics. 256. 206–290. 20 indexed citations

16.

Conlon, David, Jacob Fox, & Benny Sudakov. (2014). Cycle packing. Random Structures and Algorithms. 45(4). 608–626. 6 indexed citations

17.

Conlon, David, Jacob Fox, & Benny Sudakov. (2012). Essays in extremal combinatorics. arXiv (Cornell University). 2 indexed citations

18.

Conlon, David, Jacob Fox, & Benny Sudakov. (2012). Erdős–Hajnal-type theorems in hypergraphs. Journal of Combinatorial Theory Series B. 102(5). 1142–1154. 6 indexed citations

19.

Conlon, David, Jacob Fox, & Benny Sudakov. (2010). An improved bound for the stepping-up lemma. Discrete Applied Mathematics. 161(9). 1191–1196. 19 indexed citations

20.

Conlon, David, Jacob Fox, & Benny Sudakov. (2009). Hypergraph Ramsey numbers. Journal of the American Mathematical Society. 23(1). 247–266. 41 indexed citations

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.

Explore authors with similar magnitude of impact