S. Haghshenas

most citedPartitioning The Edge Set of a Hypergraph Into Almost Regular Cycles

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2020

On Regular Set Systems Containing Regular Subsystems

Amin Bahmanian, Sadegheh Haghshenas

Let $X, Y$ be finite sets, $r, s, h, λ \in N$ with $s \geq r, X ⊊ Y$ . By $λ (h X)$ we mean the collection of all $h$ -subsets of $X$ where each subset occurs $λ$ t…

math.CO2018★ 2 cited

Partitioning The Edge Set of a Hypergraph Into Almost Regular Cycles

Amin Bahmanian, Sadegheh Haghshenas

A cycle of length $t$ in a hypergraph is an alternating sequence $v_{1}, e_{1}, v_{2} \dots, v_{t}, e_{t}$ of distinct vertices $v_{i}$ and distinct edges $e_{i}$ so that $\{v_i,v_{i+1}\}\subseteq e_…