Critical 3-hypergraphs

From MaRDI portal
Publication:2108059

DOI10.1007/S00373-022-02595-8zbMATH Open1505.05102arXiv2006.14527OpenAlexW4311249184MaRDI QIDQ2108059FDOQ2108059


Authors: Abderrahim Boussaïri, Brahim Chergui, P. Ille, Mohamed Zaidi Edit this on Wikidata


Publication date: 19 December 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Abstract: Given a 3-hypergraph H, a subset M of V(H) is a module of H if for each einE(H) such that ecapMeqemptyset and esetminusMeqemptyset, there exists minM such that ecapM=m and for every ninM, we have (esetminusm)cupninE(H). For example, emptyset, V(H) and v, where vinV(H), are modules of H, called trivial. A 3-hypergraph is prime if all its modules are trivial. Furthermore, a prime 3-hypergraph is critical if all its induced subhypergraphs, obtained by removing one vertex, are not prime. We characterize the critical 3-hypergraphs.


Full work available at URL: https://arxiv.org/abs/2006.14527




Recommendations




Cites Work


Cited In (1)





This page was built for publication: Critical 3-hypergraphs

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