Directed Moore hypergraphs (Q1902896)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Directed Moore hypergraphs |
scientific article |
Statements
Directed Moore hypergraphs (English)
0 references
5 June 1996
0 references
For any directed hypergraph \(H\) with \(n\) vertices, maximum out-degree \(d^+\), maximum out-size \(s^+\) and diameter \(D\) we have \(n\leq \sum^D_{i= 0} (d^+ s^+)^i\). The authors prove a conjecture of Jean-Claude Bermond, which states that this bound cannot be attained if \(D> 1\) unless \(H\) is a directed cycle. Directed hypergraphs that attain this bound are called directed Moore hypergraphs. In addition, the authors prove that directed Moore hypergraphs can be identified with certain kinds of matrix factorizations.
0 references
directed hypergraph
0 references
conjecture of Jean-Claude Bermond
0 references
directed Moore hypergraphs
0 references
matrix factorizations
0 references