Enumeration of Certain Classes of $T_0$-hypergraphs
Goran Kilibarda, Vladeta Jovovi\'c

TL;DR
This paper presents a general method for enumerating certain classes of $T_0$-hypergraphs, focusing on properties of hypergraphs and their duals, with particular attention to covers and connected hypergraphs.
Contribution
It introduces a new enumeration method for specific classes of $T_0$-hypergraphs based on their properties and duals, addressing complex classes like covers and connected hypergraphs.
Findings
Developed a general enumeration framework for $T_0$-hypergraphs.
Identified classes of hypergraphs with complex enumeration challenges.
Focused on enumeration of covers and connected hypergraphs.
Abstract
A hypergraph is a -hypergraph if for every two different vertices of the hypergraph there exists an edge containing one of the vertices and not containing the other. A general method for the enumeration of certain classes of -hypergraphs is given. -hypergraphs that are considered here are singled out both by the properties they themselves satisfy and by the properties that dual hypergraphs associated with them satisfy. Though in case of the so-called ordered hipergraphs the property `to be a -hypergraph' is reduced to the property `to having different columns' of corresponding matrices, combining this property with some properties, that we are considering here, gives sometimes classes of hypergraphs that are not so easy to enumerate. The problem of enumerating some of thus obtained classes remains unsolved. Special attention is devoted to enumerating of different…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Advanced Combinatorial Mathematics · Topological and Geometric Data Analysis
