Jonathan Schrodt

collaborators

2 papers

math.CO2024

Hitting times in the binomial random graph

Bertille Granet, Felix Joos, Jonathan Schrodt

Fix $k \geq 2$ , choose $\frac{l o g n}{n ^{(k - 1) / k}} \leq p \leq 1 - Ω (\frac{l o g ^{4} n}{n})$ , and consider $G \sim G (n, p)$ . For any pair of vertices $v, w \in V (G)$ , we give a simple and prec…

math.CO2023

Counting oriented trees in digraphs with large minimum semidegree

Felix Joos, Jonathan Schrodt

Let $T$ be an oriented tree on $n$ vertices with maximum degree at most $e^{o (l o g n)}$ . If $G$ is a digraph on $n$ vertices with minimum semidegree $δ^0(G)\geq(\frac12+o(1)…