5 citations · 7 across the 4 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
A tight single-change covering design with block size 6
Richard Bean
We give a tight single-change covering design with and . This answers Problem 1 of the Nineteenth British Combinatorial Conference, which asked whether such a design ex…
math.CO2026
Critical Sets in Latin Squares and Associated Structures
Richard Winston Bean
A critical set in a Latin square of order is a set of entries in an array which can be embedded in precisely one Latin square of order , with the property that i…
math.CO2001
A new bound on the size of the largest critical set in a Latin square
Richard Bean, E. S. Mahmoodian
A critical set in an n x n array is a set C of given entries, such that there exists a unique extension of C to an n x n Latin square and no proper subset of C has this property. T…