2 citations · 2 across the 5 of their papers we have counts for
6 papers
Concentration of the largest induced tree size of around the standard expectation threshold
Jakob Hofstad
Let be the size of the largest induced tree of , and let be the binomial random graph. Kamaldinov, Skorkin, and Zhukovskii proved that equals one o…
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…
Behavior of the Minimum Degree Throughout the -process
Jakob Hofstad
The -process generates a graph at random by starting with an empty graph with vertices, then adding edges one at a time uniformly at random among all pairs of vertices which…
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…
Linear Factorization of Hypercyclic Functions for Differential Operators
Kit C. Chan, Jakob Hofstad, David Walmsley
On the Fréchet space of entire functions , we show that every nonscalar continuous linear operator which commutes with differentia…