Namrata

activity

20242026

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Kneser graphs are Hamiltonian

Arturo Merino, Torsten MÃ¼tze, Namrata

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Kneser graph $K (n, k)$ has as vertices all $k$ -element subsets of an $n$ -element ground set, and an edge between any two disjoint sets.…

math.CO2024

Hamiltonicity of Schrijver graphs and stable Kneser graphs

Torsten MÃ¼tze, Namrata

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Schrijver graph $S (n, k)$ has as vertices all $k$ -element subsets of $[n] := {1, 2, \dots, n}$ that contain no two cyclically adjacent ele…