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
Publication date: 19 December 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Abstract: Given a 3-hypergraph , a subset of is a module of if for each such that and , there exists such that and for every , we have . For example, , and , where , are modules of , 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
Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- \(P_ 4\)-trees and substitution decomposition
- The \(C_{3}\)-structure of the tournaments.
- Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
- Title not available (Why is that?)
- Indecomposable graphs
- Parity Graphs
- Indecomposability graph and critical vertices of an indecomposable graph
- Title not available (Why is that?)
- Critically twin primitive 2-structures
- On Convex Subsets in Tournaments
- Prime 3-uniform hypergraphs
- 3-uniform hypergraphs: modular decomposition and realization by tournaments
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)