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 (defined by inclusion of pairs in edges) for one natural class of hypergraphs: the triple systems with index three. Such systems with nonsingular (over the rationals) appear to be quite rare, yet they can be constructed with PBD closure. In fact, a range of ranks near is obtained for large orders .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.