Editing Tournament (graph theory) (section)

== References ==
*{{citation|last1=Austen-Smith|first1=D.|first2=J.|last2=Banks|title=Positive Political theory|year=1999|publisher=University of Michigan Press}}
*{{citation
 | last1 = Bang-Jensen | first1 = J. 
 | last2 = Gutin | first2 = G. | author2-link = Gregory Gutin
 | last3 = Yeo | first3 = A. 
 | journal = Combinatorics, Probability and Computing
 | pages = 255–261
 | title = Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
 | volume = 6
 | year = 1997| issue = 3 
 | doi = 10.1017/S0963548397003027 
 }}
*{{citation|doi=10.1137/0403002|first1=A.|last1=Bar-Noy|first2=J.|last2=Naor|author2-link=Joseph Seffi Naor|title=Sorting, Minimal Feedback Sets and Hamilton Paths in Tournaments|journal=[[SIAM Journal on Discrete Mathematics]]|volume=3|issue=1|pages=7–20|year=1990}}
*{{citation|last1=Brandt|first1=Felix|last2=Brill|first2=Markus|last3=Harrenstein|first3=Paul|contribution=Chapter 3: Tournament Solutions|title=Handbook of Computational Social Choice |editor1-last=Brandt|editor1-first=Felix|editor2-last=Conitzer|editor2-first=Vincent|editor3-last=Endriss|editor3-first=Ulle|editor4-last=Lang|editor4-first=Jérôme|editor5-last=Procaccia|editor5-first=Ariel D.|publisher=Cambridge University Press|year=2016|isbn=9781107060432}}
* {{Citation | first=Paul | last=Camion
| title=Chemins et circuits hamiltoniens des graphes complets 
| journal=[[Comptes Rendus de l'Académie des Sciences de Paris]]
| url = https://gallica.bnf.fr/ark:/12148/bpt6k731d/f1025.item
| language = French
| volume=249 | year=1959 | pages=2151&ndash;2152 }}
*{{citation
 | last = Erdős | first = P. | author1-link = Paul Erdős
 | journal = [[The Mathematical Gazette]]
 | jstor = 3613396
 | mr = 0159319
 | pages = 220–223
 | title = On a problem in graph theory
 | url = http://www.renyi.hu/~p_erdos/1963-08.pdf
 | volume = 47
 | year = 1963| issue = 361 | doi = 10.2307/3613396 }}
*{{citation
 | last1 = Erdős | first1 = P. | author1-link = Paul Erdős
 | last2 = Moser | first2 = L. | author2-link = Leo Moser
 | journal = Magyar Tud. Akad. Mat. Kutató Int. Közl.
 | mr = 0168494
 | pages = 125–132
 | title = On the representation of directed graphs as unions of orderings
 | url = http://www.renyi.hu/~p_erdos/1964-22.pdf
 | volume = 9
 | year = 1964}}
*{{citation
 | last1 = Fraisse | first1 = P. 
 | last2 = Thomassen | first2 = C. 
 | journal = [[Graphs and Combinatorics]]
 | pages = 239–250
 | title = A constructive solution to a tournament problem
 | volume = 3
 | year = 1987 | doi = 10.1007/BF01788546 
 }}.
*{{citation
 | last1 = Graham | first1 = R. L. | author1-link = Ronald Graham
 | last2 = Spencer | first2 = J. H. | author2-link = Joel Spencer
 | journal = [[Canadian Mathematical Bulletin]]
 | mr = 0292715
 | pages = 45–48
 | title = A constructive solution to a tournament problem
 | volume = 14
 | year = 1971 | doi=10.4153/cmb-1971-007-1}}.
*{{citation
 | last1 = Harary | first1 = Frank | author1-link = Frank Harary
 | last2 = Moser | first2 = Leo | author2-link = Leo Moser
 | doi = 10.2307/2315334
 | issue = 3
 | journal = [[American Mathematical Monthly]]
 | pages = 231–246
 | title = The theory of round robin tournaments
 | volume = 73
 | year = 1966
 | jstor = 2315334}}.
*{{citation
 | last = Havet | first = Frédéric
 | contribution = Section 3.1: Gallai–Roy Theorem and related results
 | contribution-url = https://oc.g-scop.grenoble-inp.fr/conf/sgt2013/oleron.pdf
 | pages = 15–19
 | series = Lecture notes for the summer school SGT 2013 in Oléron, France
 | title = Orientations and colouring of graphs
 | year = 2013}}
* {{Citation | first=H.G. | last=Landau | title=On dominance relations and the structure of animal societies. III. The condition for a score structure | journal=[[Bulletin of Mathematical Biophysics]] | volume=15 | issue=2 | pages=143–148 | year=1953 | doi=10.1007/BF02476378}}.
*{{citation
 | last = Laslier | first = J.-F.
 | title = Tournament Solutions and Majority Voting
 | publisher = Springer
 | year = 1997}}
*{{citation|last=McGarvey|first=David C.|year=1953|title=A Theorem on the Construction of Voting Paradoxes|jstor=1907926|journal=Econometrica|volume=21|issue=4|pages=608–610|doi=10.2307/1907926}}
*{{citation
 | doi = 10.4153/CMB-1966-038-7
 | last = Moon | first = J. W.
 | issue = 3
 | journal = [[Canadian Mathematical Bulletin]]
 | pages = 297–301
 | title = On subtournaments of a tournament
 | url = http://cms.math.ca/cmb/v9/p297
 | volume = 9
 | year = 1966| doi-access = free
 }}.
* {{Citation | first=László | last=Rédei | authorlink = László Rédei
| title=Ein kombinatorischer Satz | journal=Acta Litteraria Szeged | volume=7 
| year=1934 | pages=39&ndash;43 }}.
* {{Citation | first1=K.B. | last1=Reid |first2=E.T. | last2=Parker
| title=Disproof of a conjecture of Erdös and Moser | journal=[[Journal of Combinatorial Theory]] | volume=9 | issue=3 | doi=10.1016/S0021-9800(70)80061-8
| year=1970 | pages=225&ndash;238 | doi-access=free }}
*{{citation|last=Stearns|first=Richard|year=1959|title=The Voting Problem|jstor=2310461|journal=The American Mathematical Monthly|volume=66|issue=9|pages=761–763|doi=10.2307/2310461}}
*{{citation
 | last1 = Szekeres | first1 = E. | author1-link = Esther Szekeres
 | last2 = Szekeres | first2 = G. | author2-link = George Szekeres
 | journal = [[The Mathematical Gazette]]
 | mr = 0186566
 | pages = 290–293
 | title = On a problem of Schütte and Erdős
 | volume = 49
 | year = 1965 | issue = 369 | doi=10.2307/3612854| jstor = 3612854 }}.
*{{Citation | title=A Bernoulli Excursion and Its Various Applications | journal=Advances in Applied Probability | year=1991|volume=23 | issue=3 | pages= 557–585 | doi=10.2307/1427622 | publisher=Applied Probability Trust | last=Takács | first=Lajos | authorlink = Lajos Takács | jstor=1427622}}.
* {{Citation | first1=Carsten | last1=Thomassen | authorlink = Carsten Thomassen (mathematician) | year=1980
| title=Hamiltonian-Connected Tournaments 
| journal=[[Journal of Combinatorial Theory]] | series = Series B | volume=28 | issue=2 | pages=142&ndash;163
| doi=10.1016/0095-8956(80)90061-1 | doi-access=free }}.
* {{Citation | first=T.X. | last=Yao | year=1989
| title=On Reid conjecture of score sets for tournaments 
| journal=Chinese Sci. Bull.  | volume=34 | pages=804&ndash;808 }}.

{{PlanetMath attribution|id=3518|title=tournament}}
{{Authority control}}

{{DEFAULTSORT:Tournament (Graph Theory)}}
[[Category:Directed graphs]]