What must be contained in every oriented k-uniform hypergraph (Q1092925): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(86)90219-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093167710 / rank | |||
Normal rank | |||
Latest revision as of 12:02, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What must be contained in every oriented k-uniform hypergraph |
scientific article |
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
