Anna Geisler

collaborators

2 papers

math.CO2024

Minimum degree $k$ and $k$ -connectedness usually arrive together

Sahar Diskin, Anna Geisler

Let $d, n \in N$ be such that $d = ω (1)$ , and $d \leq n^{1 - a}$ for some constant $a > 0$ . Consider a $d$ -regular graph $G = (V, E)$ and the random graph process that starts with the…

math.CO2024

Perfect Matching in Product Graphs and in their Random Subgraphs

Sahar Diskin, Anna Geisler

For $t \in N$ and ever $i \in [t]$ , let $H_{i}$ be a $d_{i}$ -regular connected graph with $1 < ∣ V (H_{i}) ∣ \leq M$ for some integer $M \geq 2$ . Let $G = □_{i = 1}^{t} H_{i}$ be the $t$ -dime…

Minimum degree k and k-connectedness usually arrive together

Perfect Matching in Product Graphs and in their Random Subgraphs

Minimum degree $k$ and $k$ -connectedness usually arrive together