activity
20192026
most citedTwo-Point Concentration of the Independence Number of the Random Graph

2 citations · 2 across the 5 of their papers we have counts for

collaborators

6 papers

math.CO2026

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…

math.CO2024

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…

math.CO2023

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…

math.CO2022★ 2 cited

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…

math.CO2022

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…

math.FA2019

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…