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 N2 (defined by inclusion of pairs in edges) for one natural class of hypergraphs: the triple systems with index three. Such systems with nonsingular N2 (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 v.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
