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

DOI10.1016/J.LAA.2017.09.022zbMATH Open1373.05031OpenAlexW2758794011MaRDI QIDQ1675656FDOQ1675656

Authors: 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

Recommendations

• Defining sets and critical sets in \((0,1)\)-matrices
• The maximum, supremum, and spectrum for critical set sizes in \((0,1)\)-matrices
• Most binary matrices have no small defining set
• Lower bounds on the sizes of defining sets in full \(n\)-Latin squares and full designs
• Critical sets of 2-balanced Latin rectangles

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Combinatorial matrix classes
• A theorem on flows in networks
• Title not available (Why is that?)
• Matrices of zeros and ones with fixed row and column sum vectors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Defining Sets and Critical Sets in (0,1)‐Matrices
• On the size of the minimum critical set of a Latin square
• Title not available (Why is that?)
• Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph

Cited In (1)

• Most binary matrices have no small defining set

This page was built for publication: Constructing (0,1)-matrices with large minimal defining sets

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