Structure theorem for tournaments omitting <i>N</i><sub>5</sub> (Q4800397): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Tournaments whose Subtournaments are Irreducible or Transitive / rank | |||
Normal rank | |||
Latest revision as of 13:55, 5 June 2024
scientific article; zbMATH DE number 1892463
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Structure theorem for tournaments omitting <i>N</i><sub>5</sub> |
scientific article; zbMATH DE number 1892463 |
Statements
Structure theorem for tournaments omitting <i>N</i><sub>5</sub> (English)
0 references
3 April 2003
0 references
antichain
0 references
decidability
0 references
decomposition
0 references
embedding
0 references
Higman
0 references
indecomposable
0 references
Kruskal
0 references
local order
0 references
tournament well-quasi-order
0 references
