25 citations · 61 across the 8 of their papers we have counts for
10 papers
Embedding Irregular Colorings into Connected Factorizations
Amin Bahmanian, Anna Johnsen
For , an -factorization of the complete -fold -uniform -vertex hypergraph is a partition of (the edges of) into s…
Symmetric Layer-Rainbow Colorations of Cubes
Amin Bahmanian
Can we color the cells of an cube with colors in such a way that each layer parallel to each face contains each color exactly once and that the…
On Factors with Prescribed Degrees in Bipartite Graphs
Amin Bahmanian
We establish a new criterion for a bigraph to have a subgraph with prescribed degree conditions. We show that the bigraph has a spanning subgraph such that $g(x)\leq d…
Ryser's Theorem for -latin Rectangles
Amin Bahmanian
Let be an array whose top left subarray is filled with different symbols, each occurring at most once in each row and at most once in each column. W…
Resolvable Cycle Decompositions of Complete Multigraphs and Complete Equipartite Multigraphs via Layering and Detachment
Amin Bahmanian, Mateja Šajna
We construct new resolvable decompositions of complete multigraphs and complete equipartite multigraphs into cycles of variable lengths (and a perfect matching if the vertex degree…
Partitioning The Edge Set of a Hypergraph Into Almost Regular Cycles
Amin Bahmanian, Sadegheh Haghshenas
A cycle of length in a hypergraph is an alternating sequence of distinct vertices and distinct edges so that $\{v_i,v_{i+1}\}\subseteq e_…