119 citations · 230 across the 26 of their papers we have counts for
33 papers
The largest -free set of vertices in a random graph
Tom Bohman, Marcus Michelen, Dhruv Mubayi
For and a graph , let be the maximum number of vertices in a -free subgraph of . We investigate the value when is the random graph $G…
A note on Two-Point Concentration of the Independence Number of
Tom Bohman, Jakob Hofstad
We show that the independence number of is concentrated on two values for . This result establishes a distinction between and…
Two-Point Concentration of the Domination Number of Random Graphs
Tom Bohman, Lutz Warnke, Emily Zhu
We show that the domination number of the binomial random graph G_{n,p} with edge-probability p is concentrated on two values for p \ge n^{-2/3+\eps}, and not concentrated on two v…
Two-Point Concentration of the Independence Number of the Random Graph
Tom Bohman, Jakob Hofstad
We show that the independence number of is concentrated on two values if . This result is roughly best possible as an argument of Sah and Sawhney…
A Critical Probability for Biclique Partition of
Tom Bohman, Jakob Hofstad
The biclique partition number of a graph , denoted , is the minimum number of pairwise edge disjoint complete bipartite subgraphs of so that each edge of b…
Complexes of nearly maximum diameter
Tom Bohman, Andrew Newman
The diameter of a strongly connected -dimensional simplicial complex is the diameter of its dual graph. We provide a probabilistic proof of the existence of -dimensional simp…