Sparse 0−1 Matrices and Forbidden Hypergraphs

DOI10.1017/S0963548399004058MaRDI QIDQ4934780zbMATH OpenFDO

Authors Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann

Publication date 21 June 2000

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548399004058

zbMATH Keywords

forbidden hypergraphspolynomial time algorithmsparse 0-1 matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65)

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

Cited in

(10)

• On \(n\)-column 0,1-matrices with all \(k\)-projections surjective
• On sparse parity check matrices
• Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case
• On the maximum density of 0-1 matrices with no forbidden rectangles
• Maximum 4-block-free matrices and knapsack-type relaxations
• An Extremal Problem on Sparse 0-1 Matrices
• scientific article; zbMATH DE number 1303555 (Why is no real title available?)
• scientific article; zbMATH DE number 6297801 (Why is no real title available?)
• On sparse parity check matrices (extended abstract)
• 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)