Score sequences in oriented graphs (Q874343)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5140492
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Score sequences in oriented graphs |
scientific article; zbMATH DE number 5140492 |
Statements
Score sequences in oriented graphs (English)
0 references
5 April 2007
0 references
The authors first give a new proof of Avery's theorem that characterizes the score sequences in oriented graphs. This new proof of Avery's theorem is obtained by using induction and is based on the proof of Landau's theorem on tournaments given by E. S. Mahmoodian and C. Thomassen. The authors also obtain some stronger inequalities for scores in oriented graphs and they characterize strongly transitive oriented graphs.
0 references
tournament
0 references
triples
0 references
0 references
0.876734733581543
0 references
0.8643528819084167
0 references
0.8012405037879944
0 references
0.7980256080627441
0 references
