Tom Bohman

1.4k total citations
54 papers, 649 citations indexed

About

Tom Bohman is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology. According to data from OpenAlex, Tom Bohman has authored 54 papers receiving a total of 649 indexed citations (citations by other indexed papers that have themselves been cited), including 44 papers in Discrete Mathematics and Combinatorics, 39 papers in Computational Theory and Mathematics and 18 papers in Geometry and Topology. Recurrent topics in Tom Bohman's work include Limits and Structures in Graph Theory (44 papers), Advanced Graph Theory Research (27 papers) and Graph theory and applications (12 papers). Tom Bohman is often cited by papers focused on Limits and Structures in Graph Theory (44 papers), Advanced Graph Theory Research (27 papers) and Graph theory and applications (12 papers). Tom Bohman collaborates with scholars based in United States, Israel and Singapore. Tom Bohman's co-authors include Alan Frieze, David A. Kravitz, Ron Holzman, Ryan R. Martin, Dhruv Mubayi, Nicholas Wormald, Oleg Pikhurko, Michael Krivelevich, József Balogh and Jeong Han Kim and has published in prestigious journals such as IEEE Transactions on Information Theory, Transactions of the American Mathematical Society and SIAM Journal on Computing.

In The Last Decade

Tom Bohman

49 papers receiving 607 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Tom Bohman United States 15 394 362 227 156 78 54 649
Balázs Szegedy Hungary 13 443 1.1× 486 1.3× 388 1.7× 158 1.0× 39 0.5× 39 854
Imre Leader United Kingdom 15 398 1.0× 385 1.1× 309 1.4× 137 0.9× 121 1.6× 71 706
Dirk Vertigan United States 15 543 1.4× 298 0.8× 227 1.0× 96 0.6× 124 1.6× 30 752
Catherine H. Yan United States 13 166 0.4× 272 0.8× 206 0.9× 159 1.0× 45 0.6× 56 612
Neil J. Calkin United States 11 240 0.6× 177 0.5× 121 0.5× 79 0.5× 56 0.7× 48 504
Louigi Addario‐Berry Canada 14 339 0.9× 126 0.3× 118 0.5× 245 1.6× 153 2.0× 49 684
K. Vesztergombi Hungary 9 296 0.8× 262 0.7× 234 1.0× 109 0.7× 21 0.3× 12 639
Cyril Banderier France 9 175 0.4× 317 0.9× 80 0.4× 203 1.3× 44 0.6× 24 542
L. Bruce Richmond Canada 15 185 0.5× 305 0.8× 164 0.7× 247 1.6× 29 0.4× 55 602
François Jaeger France 13 444 1.1× 391 1.1× 390 1.7× 160 1.0× 101 1.3× 36 779

Countries citing papers authored by Tom Bohman

Since Specialization
Citations

This map shows the geographic impact of Tom Bohman'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 Tom Bohman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tom Bohman more than expected).

Fields of papers citing papers by Tom Bohman

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tom Bohman. 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 Tom Bohman. The network helps show where Tom Bohman may publish in the future.

Co-authorship network of co-authors of Tom Bohman

This figure shows the co-authorship network connecting the top 25 collaborators of Tom Bohman. A scholar is included among the top collaborators of Tom Bohman 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 Tom Bohman. Tom Bohman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bohman, Tom, et al.. (2024). A critical probability for biclique partition of G,. Journal of Combinatorial Theory Series B. 166. 50–79. 1 indexed citations
2.
Bohman, Tom, et al.. (2024). Two-Point Concentration of the Independence Number of the Random Graph. Forum of Mathematics Sigma. 12. 1 indexed citations
3.
Bohman, Tom, et al.. (2023). On Multicolor Ramsey Numbers of Triple System Paths of Length 3. SIAM Journal on Discrete Mathematics. 37(3). 1419–1435. 1 indexed citations
4.
Bohman, Tom & Fei Peng. (2022). A Construction for Boolean Cube Ramsey Numbers. Order. 40(2). 327–333. 5 indexed citations
5.
Alon, Noga, Tom Bohman, & Hao Huang. (2016). More on the Bipartite Decomposition of Random Graphs. Journal of Graph Theory. 84(1). 45–52. 4 indexed citations
6.
Bennett, Patrick & Tom Bohman. (2016). A note on the random greedy independent set algorithm. Random Structures and Algorithms. 49(3). 479–502. 7 indexed citations
7.
Bohman, Tom, Alan Frieze, & Eyal Lubetzky. (2015). Random triangle removal. Advances in Mathematics. 280. 379–438. 13 indexed citations
8.
Bohman, Tom, Ron Holzman, & Venkatesh Natarajan. (2013). On the Independence Numbers of the Cubes of Odd Cycles. The Electronic Journal of Combinatorics. 20(3). 6 indexed citations
9.
Bohman, Tom, et al.. (2012). SIR epidemics on random graphs with a fixed degree sequence. Random Structures and Algorithms. 41(2). 179–214. 19 indexed citations
10.
Bohman, Tom, Alan Frieze, Dhruv Mubayi, & Oleg Pikhurko. (2010). Hypergraphs with independent neighborhoods. COMBINATORICA. 30(3). 277–293. 5 indexed citations
11.
Bohman, Tom, Andrzej Dudek, Alan Frieze, & Oleg Pikhurko. (2010). Flips in Graphs. SIAM Journal on Discrete Mathematics. 24(3). 1046–1055.
12.
Bohman, Tom, Alan Frieze, Oleg Pikhurko, & Clifford Smyth. (2009). Anti-Ramsey properties of random graphs. Journal of Combinatorial Theory Series B. 100(3). 299–312. 5 indexed citations
13.
Bohman, Tom, Alan Frieze, & Dhruv Mubayi. (2009). Coloring H‐free hypergraphs. Random Structures and Algorithms. 36(1). 11–25. 14 indexed citations
14.
Bohman, Tom. (2009). The triangle-free process. Advances in Mathematics. 221(5). 1653–1677. 55 indexed citations
15.
Beveridge, Andrew, Tom Bohman, Alan Frieze, & Oleg Pikhurko. (2009). Memoryless Rules for Achlioptas Processes. SIAM Journal on Discrete Mathematics. 23(2). 993–1008. 3 indexed citations
16.
Bohman, Tom & David A. Kravitz. (2004). On the irregularity strength of trees. Journal of Graph Theory. 45(4). 241–254. 54 indexed citations
17.
Bohman, Tom. (2004). A limit theorem for the Shannon capacities of odd cycles. II. Proceedings of the American Mathematical Society. 133(2). 537–543. 8 indexed citations
18.
Bohman, Tom. (2003). A limit theorem for the Shannon capacities of odd cycles I. Proceedings of the American Mathematical Society. 131(11). 3559–3569. 19 indexed citations
19.
Bohman, Tom & Ron Holzman. (2002). On a list coloring conjecture of Reed. Journal of Graph Theory. 41(2). 106–109. 8 indexed citations
20.
Bohman, Tom. (1996). A sum packing problem of Erdös and the Conway-Guy sequence. Proceedings of the American Mathematical Society. 124(12). 3627–3636. 15 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

Rankless by CCL
2026