Non-magic Hypergraphs

MaRDI QIDQ6298349zbMATH OpenFDO

Authors Benjamin Ellis, David A. Nash, Jonathan Needleman, Michael W. Raney

Publication date 28 February 2018

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Hypergraphs (05C65) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Linear incidence geometry (51A99)

Abstract: This article studies a generalization of magic squares to $k$-uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized to allow for labels coming from any abelian group. We demonstrate an algorithm for determining whether a given hypergraph has a magic labeling over some abelian group. A slight adjustment of this algorithm also allows one to determine whether a given hypergraph can be magically labeled over $mathbbZ$. As a demonstration, we use these algorithms to determine the number of magic $n_3$-configurations for $n=7,dots,14$.

This page was built for publication: Non-magic Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6298349)