Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647007 | Discrete Mathematics | 2015 | 4 Pages |
Abstract
There are various results connecting ranks of incidence matrices of graphs and hypergraphs with their combinatorial structure. Here, we consider the generalized incidence matrix N2N2 (defined by inclusion of pairs in edges) for one natural class of hypergraphs: the triple systems with index three. Such systems with nonsingular N2N2 (over the rationals) appear to be quite rare, yet they can be constructed with PBD closure. In fact, a range of ranks near (v2) is obtained for large orders vv.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter J. Dukes, Kseniya Garaschuk,