Depth in bingo closure

MaRDI QIDQ3581909zbMATH OpenFDO

Authors Jeffrey Beyerl, Robert E. Jamison, J. Bowman Light

Publication date 2 September 2010

Full work available at URL https://arxiv.org/abs/1109.6693

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Abstract: Bingo is played on a $5imes5$ grid. Take the 25 squares to be the ground set of a closure system in which square $s$ is dependent on a set $S$ of squares iff $s$ completes a line - a row, column, or diagonal - with squares that are already in $S$. The closure of a set $S$ is obtained via an iterative process in which, at each stage, the squares dependent upon the current state are added. In this paper we establish for the $nimesn$ Bingo board the maximum number of steps required in this closure process.

Recommendations

• The Bingo game
• scientific article; zbMATH DE number 1270966
• scientific article; zbMATH DE number 2036134
• scientific article; zbMATH DE number 1194756
• scientific article; zbMATH DE number 4035609

Cited in

(2)

• The Bingo game
• scientific article; zbMATH DE number 2036134 (Why is no real title available?)

This page was built for publication: Depth in bingo closure

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