Skip to main content

About the Inequalities of Erdös and Moser on the largest transitive subtournament of a tournament

  • 850 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1234)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. ERDÖS and L. MOSER, A problem on tournaments, Can. Math. Bull. 7 (1964), 351–356.

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. P. ERDÖS and L. MOSER, On the representation of directed graphs as unions of orderings, Publ. Math. Inst. Hungar. Acad. Sci. 9 (1964), 125–132.

    MathSciNet  MATH  Google Scholar 

  3. A. KOTZIG, Cycles in a complete graph oriented in equilibrium, Mat.-Fyz. Casopis 16 (1966), 175–182.

    MathSciNet  MATH  Google Scholar 

  4. A. KOTZIG, Sur les tournois avec des 3-cycles régulièrement placés, Mat. Casopis 19 (1969), 126–134.

    MathSciNet  MATH  Google Scholar 

  5. J.W. MOON, Topics on Tournaments, Holt, Rinehart and Winston, 1968.

    Google Scholar 

  6. K.B. REID and L.W. BEINEKE, Tournaments, Chapter 7 in "Selected Topics in Graph Theory", edited by Beineke and Wilson, Academic Press, 1978.

    Google Scholar 

  7. K.B. REID and E. BROWN, Doubly regular tournaments are equivalent to skew Hadamard matrices, Jour. Combin. Theory 12 (1972), 332–338.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. K.B. REID and E.T. PARKER, Disproof of a conjecture of Erdös and Moser on tournaments, Jour. Combin. Theory 9 (1970), 225–238.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. R. STEARNS, The voting problem, Am. Math. Monthly 66 (1959), 761–763.

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. C. TABIB, La théorie des tournois réguliers pourvus de symétries supplémentaires, Ph.D. Thesis, Université de Montréal, 1978.

    Google Scholar 

  11. C. TABIB, Caractérisation des tournois presqu'homogènes, Ann. of Discrete Math. 8 (1980), 77–82.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. C. TABIB, The number of 4-cycles in regular tournaments, Utilitas Math. 22 (1982), 315–322.

    MathSciNet  MATH  Google Scholar 

  13. C. TABIB, Pluralité des tournois homogènes de même ordre, Ann. sc. math. Québec 8 (1984), no 1, 81–95.

    MathSciNet  MATH  Google Scholar 

  14. C. TABIB, Construction of an infinity of pairs of homogeneous tournaments, Proceedings of the Tenth British Combinatorial Conference, Ars Combinatoria 20A/20B (1986), 7 p. In press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Tabib, C. (1986). About the Inequalities of Erdös and Moser on the largest transitive subtournament of a tournament. In: Labelle, G., Leroux, P. (eds) Combinatoire énumérative. Lecture Notes in Mathematics, vol 1234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0072523

Download citation

  • DOI: https://doi.org/10.1007/BFb0072523

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17207-9

  • Online ISBN: 978-3-540-47402-9

  • eBook Packages: Springer Book Archive