E. Mendelsohn

most citedZero-sum flows for Steiner triple systems

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

collaborators

4 papers

math.CO2023

On the minisymposium problem

Peter Danziger, Eric Mendelsohn, Brett Stevens +1

The generalized Oberwolfach problem asks for a factorization of the complete graph $K_{v}$ into prescribed $2$ -factors and at most a $1$ -factor. When all $2$ -factors are pairwise iso…

math.CO2015

On the existence of unparalleled even cycle systems

Peter Danziger, Eric Mendelsohn, Tommaso Traetta

A $2 t$ -cycle system of order $v$ is a set $C$ of cycles whose edges partition the edge-set of $K_{v} - I$ (i.e., the complete graph minus the $1$ -factor $I$ ). If $v\equiv 0 \…

math.CO2015★ 1 cited

Zero-sum flows for Steiner triple systems

S. Akbari, A. C. Burgess, P. Danziger +1

Given a $2$ - $(v, k, λ)$ design, $S = (X, B)$ , a {\it zero-sum $n$ -flow} of $S$ is a map $f : B ⟶ {\pm 1, \dots, \pm (n - 1)}$ such that for any poi…

math.CO2015

On generalized Howell designs with block size three

R. Julian R. Abel, Robert F. Bailey, Andrea C. Burgess +2

In this paper, we examine a class of doubly resolvable combinatorial objects. Let $t, k, λ, s$ and $v$ be nonnegative integers, and let $X$ be a set of $v$ symbols. A generalized H…