Constructing (0,1)-matrices with large minimal defining sets
From MaRDI portal
(Redirected from Publication:1675656)
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
Cites work
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- scientific article; zbMATH DE number 1334634 (Why is no real title available?)
- scientific article; zbMATH DE number 1996250 (Why is no real title available?)
- scientific article; zbMATH DE number 2114508 (Why is no real title available?)
- A theorem on flows in networks
- Combinatorial matrix classes
- Defining sets and critical sets in \((0,1)\)-matrices
- Matrices of zeros and ones with fixed row and column sum vectors
- Minimal Interchanges of (0, 1)-Matrices and Disjoint Circuits in a Graph
- On the size of the minimum critical set of a Latin square
Cited in
(3)
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)