4 problems

Let $G_{n,\delta}$ be an Erdős–Rényi random graph, and construct a temporal instance ${\cal I}(G_{n,\delta})$ by assigning labels to the edges of $G_{n,\delta}$ independently and u…

Let ${\cal G}_{n,\delta}$ denote the Erdős–Rényi random graph model with edge probability $\delta$, and let $(K_n,\lambda)$ be a random simple temporal graph. A $\delta$-clique is…

Let $n$ be the number of nodes, and let a sub-TVG be a randomly sampled sub-temporal visibility graph of the STARLINK satellite system. Let $r$ denote the convergence radius of its…

Two-arborescence conjecture. If