Talk information

Date: Sunday, May 3, 2026
Time: 10:10–11:00
Place: Schreiber 309
Speaker: Dan Hefetz (Ariel University)
Title: The Hamilton cycle space of random graphs

Abstract:

The cycle space of a graph $G$, denoted $\mathcal{C}(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $\mathcal{C}_n(G)$ denotes the subspace of $\mathcal{C}(G)$, spanned by the incidence vectors of Hamilton cycles of $G$. In this talk we consider the question of whether $\mathcal{C}_n(G) = \mathcal{C}(G)$ holds with high probability, where $G$ is sampled according to various models of random graphs.

Based on joint works with Michael Krivelevich.