Skip to main content Accessibility help
×
×
Home

Sparse 0−1 Matrices and Forbidden Hypergraphs

  • CLAUDIA BERTRAM-KRETZBERG (a1), THOMAS HOFMEISTER (a1) and HANNO LEFMANN (a1)
    • Published online: 01 September 1999
Abstract

We consider the problem of determining the maximum number N(m, k, r) of columns of a 0−1 matrix with m rows and exactly r ones in each column such that every k columns are linearly independent over ℤ2. For fixed integers k[ges ]4 and r[ges ]2, where k is even and gcd(k−1, r) = 1, we prove the lower bound N(m, k, r) = Ω(mkr/2(k−1) ·(ln m)1/k−1). This improves on earlier results from [14] by a factor Θ((ln m)1/k−1). Moreover, we describe a polynomial time algorithm achieving this new lower bound.

Copyright
Footnotes
Hide All
This research was supported by the Deutsche Forschungsgemeinschaft as part of the Collaborative Research Center ‘Computational Intelligence’ (SFB 531).This paper was submitted to the Special Issue (Volume 8, Number 4) devoted to papers from the Oberwolfach meeting on Random Graphs and Combinatorial Structures, but was inadvertently omitted from that Issue.
Footnotes
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed