Constructing (0,1)-matrices with large minimal defining sets

DOI10.1016/j.laa.2017.09.022zbMath1373.05031OpenAlexW2758794011MaRDI QIDQ1675656

Nicholas J. Cavenagh, Reshma Ramadurai

Publication date: 2 November 2017

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/10289/12057

zbMATH Keywords

defining set\((0, 1)\)-matrixfrequency squareGale-Ryser theorem\(F\)-square

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items

Most binary matrices have no small defining set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theorem on flows in networks
• Matrices of zeros and ones with fixed row and column sum vectors
• On the size of the minimum critical set of a Latin square
• Defining Sets and Critical Sets in (0,1)‐Matrices
• Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph