3 papers
math.CO2020
Critical 3-hypergraphs (detailed version)
Abderrahim Boussairi, Brahim Chergui, Pierre Ille +1
Given a 3-hypergraph , a subset of is a module of if for each such that and , there exists …
math.CO2019
Matricial characterization of tournaments with maximum number of diamonds
Wiam Belkouche, Abderrahim Boussaïri, Soufiane Lakhlifi +1
A diamond is a -tournament which consists of a vertex dominating or dominated by a -cycle. Assuming the existence of skew-conference matrices, we give a complete characteriza…
math.CO2018
3-uniform hypergraphs: modular decomposition and realization by tournaments
Abderrahim Boussaïri, Brahim Chergui, Pierre Ille +1
Let be a 3-uniform hypergraph. A tournament defined on is a realization of if the edges of are exactly the 3-element subsets of that induce 3-cyc…