25 citations · 65 across the 20 of their papers we have counts for
7 papers · 1 filter
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…
Toward a Three-dimensional Counterpart of Cruse's Theorem
Amin Bahmanian
Completing partial latin squares is NP-complete. Motivated by Ryser's theorem for latin rectangles, in 1974, Cruse found conditions that ensure a partial symmetric latin square of…
Sharp Embeddings of Layer-Rainbow Cubes and Orthogonal Pairs
Amin Bahmanian
We determine the exact extension threshold for one-factorizations of complete tripartite -uniform hypergraphs. Equivalently, for , every order- layer-rainbow cube embeds…
Ryser's Theorem for Symmetric -latin Squares
Amin Bahmanian, A. J. W. Hilton
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…
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…