Amin Bahmanian

activity

20172026

most citedMultiply Balanced Edge Colorings of Multigraphs

25 citations · 62 across the 17 of their papers we have counts for

collaborators

Showing 2017Show all

4 papers · 1 filter

math.CO2017★ 10 cited

Embedding factorizations for 3-uniform hypergraphs

Amin Bahmanian, Chris Rodger

In this paper, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address t…

math.CO2017★ 4 cited

Embedding an Edge-colored $K (a^{(p)}; λ, μ)$ into a Hamiltonian Decomposition of $K (a^{(p + r)}; λ, μ)$

Amin Bahmanian, Chris Rodger

Let $K (a^{(p)}; λ, μ)$ be a graph with $p$ parts, each part having size $a$ , in which the multiplicity of each pair of vertices in the same part (in different parts) is $λ$ ( $μ$ , res…

math.CO2017★ 21 cited

Detachments of Hypergraphs I: The Berge-Johnson Problem

Amin Bahmanian

A detachment of a hypergraph is formed by splitting each vertex into one or more subvertices, and sharing the incident edges arbitrarily among the subvertices. For a given edge-col…

math.CO2017★ 25 cited

Multiply Balanced Edge Colorings of Multigraphs

Amin Bahmanian, Chris Rodger

In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so…

Embedding factorizations for 3-uniform hypergraphs

Embedding an Edge-colored K(a(p);λ,μ) into a Hamiltonian Decomposition of K(a(p+r);λ,μ)

Detachments of Hypergraphs I: The Berge-Johnson Problem

Multiply Balanced Edge Colorings of Multigraphs

Embedding an Edge-colored $K (a^{(p)}; λ, μ)$ into a Hamiltonian Decomposition of $K (a^{(p + r)}; λ, μ)$