3-uniform hypergraphs: modular decomposition and realization by\n tournaments

2018/05/11 by Abderrahim Boussaïri, Brahim Chergui, Boussaïri, Abderrahim +6
Engineering · Decision Sciences · Mathematics · #graph theory and CDMA systems #Fuzzy and Soft Set Theory #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1805.04607

Abstract

Let H be a 3-uniform hypergraph. A tournament T defined on V(T)=V(H) is\na realization of H if the edges of H are exactly the 3-element subsets of\nV(T) that induce 3-cycles. We characterize the 3-uniform hypergraphs that\nadmit realizations by using a suitable modular decomposition.\n

Related

• Domination in 3-tournaments
• Decompositions of 3-uniform hypergraph K_v⁽³⁾ into hypergraph K₄⁽³⁾+e
• On 3-uniform hypergraphs without linear cycles
• Dense, irregular, yet always graphic 3-uniform hypergraph degree sequences
• Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs