Sparse 0−1 Matrices and Forbidden Hypergraphs
From MaRDI portal
Publication:4934780
DOI10.1017/S0963548399004058zbMATH Open0938.05019MaRDI QIDQ4934780FDOQ4934780
Authors: Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann 
Publication date: 21 June 2000
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 1303555
- Sparse hypergraphs: new bounds and constructions
- An Extremal Problem on Sparse 0-1 Matrices
- Sparse hypergraphs with applications in combinatorial rigidity
- Sparse matrix decompositions and graph characterizations
- On very sparse circulant \((0,1)\) matrices
- Publication:4729827
- Sparse hypergraphs with low independence number
- Sparse hypergraphs with applications to coding theory
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Hypergraphs (05C65)
Cited In (8)
- Maximum 4-block-free matrices and knapsack-type relaxations
- Title not available (Why is that?)
- Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case
- On sparse parity check matrices (extended abstract)
- Title not available (Why is that?)
- On the maximum density of 0-1 matrices with no forbidden rectangles
- An Extremal Problem on Sparse 0-1 Matrices
- Parity check matrices and product representations of squares
This page was built for publication: Sparse 0−1 Matrices and Forbidden Hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934780)
