What must be contained in every oriented k-uniform hypergraph (Q1092925)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: What must be contained in every oriented k-uniform hypergraph |
scientific article; zbMATH DE number 4021190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What must be contained in every oriented k-uniform hypergraph |
scientific article; zbMATH DE number 4021190 |
Statements
What must be contained in every oriented k-uniform hypergraph (English)
0 references
1986
0 references
The author defines a class of oriented k-uniform hypergraphs, called the strongly transitive hypergraphs, and proves that those are only oriented k-uniform hypergraphs which are unavoidable, i.e., contained as a subhypergraph in every orientation of the complete k-uniform hypergraph with n vertices for some n.
0 references
oriented hypergraph
0 references
unavoidable subhypergraph
0 references
