Tight Heffter Arrays Exist for all Possible Values
From MaRDI portal
Publication:5347396
DOI10.1002/jcd.21520zbMath1362.05029arXiv1509.00430OpenAlexW2358490219MaRDI QIDQ5347396
Jeffrey H. Dinitz, Tomas Boothby, Dan S. Archdeacon
Publication date: 23 May 2017
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.00430
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Triple systems (05B07)
Related Items (21)
Non-zero sum Heffter arrays and their applications ⋮ Magic rectangles, signed magic arrays and integer $\lambda$-fold relative Heffter arrays ⋮ Square integer Heffter arrays with empty cells ⋮ Rectangular Heffter arrays: a reduction theorem ⋮ Magic partially filled arrays on abelian groups ⋮ A problem on partial sums in abelian groups ⋮ Weak Heffter arrays and biembedding graphs on non-orientable surfaces ⋮ Constructing generalized Heffter arrays via near alternating sign matrices ⋮ On the existence of integer relative Heffter arrays ⋮ Conservative trees ⋮ A generalization of Heffter arrays ⋮ Orthogonal cycle systems with cycle length less than 10 ⋮ Existence of some signed magic arrays ⋮ A tour problem on a toroidal board ⋮ A note on conservative galaxies, Skolem systems, cyclic cycle decompositions, and Heffter arrays ⋮ On \(\lambda\)-fold relative Heffter arrays and biembedding multigraphs on surfaces ⋮ The existence of square non-integer Heffter arrays ⋮ Globally simple heffter arrays \(H ( n ; k )\) when \(k \equiv 0 , 3 \pmod 4 \) ⋮ Globally simple Heffter arrays and orthogonal cyclic cycle decompositions ⋮ Relative Heffter arrays and biembeddings ⋮ Heffter arrays and biembedding graphs on surfaces
Cites Work
This page was built for publication: Tight Heffter Arrays Exist for all Possible Values
