Hypergraphs with Polynomial Representation: Introducing r-splits

DOI10.46298/DMTCS.10751MaRDI QIDQ6508269arXivFDO

Authors François Pitois, Mohammed Haddad, Hamida Seba, Olivier Togni

Published in arXiv

Full work available at URL https://doi.org/10.46298/DMTCS.10751

Abstract: Inspired by the split decomposition of graphs and rank-width, we introduce the notion of $r$-splits. We focus on the family of $r$-splits of a graph of order $n$, and we prove that it forms a hypergraph with several properties. We prove that such hypergraphs can be represented using only $mathcalO(n^{r+1})$ of its hyperedges, despite its potentially exponential number of hyperedges. We also prove that there exist hypergraphs that need at least $Omega(n^r)$ hyperedges to be represented, using a generalization of set orthogonality.

This page was built for publication: Hypergraphs with Polynomial Representation: Introducing $r$-splits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6508269)