3-uniform hypergraphs: modular decomposition and realization by tournaments

DOI10.11575/cdm.v15i1.67935zbMath1447.05144arXiv1805.04607MaRDI QIDQ3303522

Pierre Ille, Abderrahim Boussaïri, Mohamed Zaidi, Brahim Chergui

Publication date: 12 August 2020

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

zbMATH Keywords

hypergraphtournamentmodulerealization3-uniform

Mathematics Subject Classification ID

Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Prime 3-uniform hypergraphs ⋮ From modular decomposition trees to rooted median graphs ⋮ Critical 3-hypergraphs ⋮ Generalized tournament matrices with the same principal minors

Cites Work

• An exact result for 3-graphs
• Theory of 2-structures. II: Representation through labeled tree families
• Partitive hypergraphs
• The \(C_{3}\)-structure of the tournaments.
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• Partially ordered sets and their comparability graphs
• An Algorithm for the Modular Decomposition of Hypergraphs
• On Convex Subsets in Tournaments
• Transitiv orientierbare Graphen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 3-uniform hypergraphs: modular decomposition and realization by tournaments