Jakob Hofstad

collaborators

3 papers

math.CO2026

Concentration of the largest induced tree size of $G_{n, p}$ around the standard expectation threshold

Jakob Hofstad

Let $T (G)$ be the size of the largest induced tree of $G$ , and let $G_{n, p}$ be the binomial random graph. Kamaldinov, Skorkin, and Zhukovskii proved that $T (G_{n, p})$ equals one o…

math.CO2024

A note on Two-Point Concentration of the Independence Number of $G_{n, m}$

Tom Bohman, Jakob Hofstad

We show that the independence number of $G_{n, m}$ is concentrated on two values for $n^{5/4 + I^µ} < m \leq (2 n)$ . This result establishes a distinction between $G_{n, m}$ an…

math.CO2024

Behavior of the Minimum Degree Throughout the $d$ -process

Jakob Hofstad

The $d$ -process generates a graph at random by starting with an empty graph with $n$ vertices, then adding edges one at a time uniformly at random among all pairs of vertices which…

Concentration of the largest induced tree size of Gn,p​ around the standard expectation threshold

A note on Two-Point Concentration of the Independence Number of Gn,m​

Behavior of the Minimum Degree Throughout the d-process

Concentration of the largest induced tree size of $G_{n, p}$ around the standard expectation threshold

A note on Two-Point Concentration of the Independence Number of $G_{n, m}$

Behavior of the Minimum Degree Throughout the $d$ -process