Skip to main content

Regularity in tournaments

  • Conference paper
  • First Online:
Book cover Theory and Applications of Graphs

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

Abstract

A nearly triply regular (abbreviated NTR) tournament is a doubly regular tournament in which every triple of distinct vertices dominates exactly j1 or j2 vertices, where 0 ≤ j1 < j2. We show that if T is NTR and if the outset of a pair of distinct vertices of T either is a singleton or spans a subtournament which is not strongly connected, then j1=0 and j2=1 and T is one of the quadratic residue tournaments of orders 7 or 11.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.00
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Alspach, On point-symmetric tournaments. Canad. Math. Bull. 13 (1970) 317–323.

    Article  MathSciNet  MATH  Google Scholar 

  2. A. Astie, Groupes d'automorphismes des tournois sommet-symétriques d'ordre premier et dénombrement de cas tournois. C. R. Acad. Sc. Paris 275 (1972) 167–169.

    MathSciNet  MATH  Google Scholar 

  3. E. Brown and K. B. Reid, Doubly regular tournaments are equivalent to skew Hadamard matrices. J. Combinatorial Theory 12 (1972) 332–338.

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Delsarte, J. M. Goethals, and J. J. Seidel, Orthogonal matrices with zero diagonal. II. Can. J. Math. 23 (1971) 816–832.

    Article  MathSciNet  MATH  Google Scholar 

  5. F. Harary and E. M. Palmer, Graphical Enumeration. Academic Press, New York and London (1973).

    MATH  Google Scholar 

  6. E. C. Johnsen, Integral solutions to the incidence equation for a finite projective plane, cases of orders n ≡ 2 (mod 4). Pacific J. Math. 17 (1966) 97–120.

    Article  MathSciNet  MATH  Google Scholar 

  7. V. Müller and J. Pelant, On strongly homogeneous tournaments. Czechoslovak Math. J. 24 (1974) 378–391.

    MathSciNet  Google Scholar 

  8. E. T. Parker and K. B. Reid, Disproof of a conjecture of Erdös and Moser on tournaments. J. Combinatorial Theory 9 (1970) 225–238.

    Article  MathSciNet  MATH  Google Scholar 

  9. A. P. Street, J. S. Wallis, and W. D. Wallis, Combinatorics: Room Squares, Sum-free Sets, Hadamard Matrices. Lecture Notes in Mathematics, 292, Springer-Verlag, Berlin-Heidelberg-New York (1972).

    Google Scholar 

  10. G. Szekeres, Tournaments and Hadamard matrices. L'Enseignement. Math. 15 (1969) 269–278.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Herzog, M., Reid, K.B. (1978). Regularity in tournaments. In: Alavi, Y., Lick, D.R. (eds) Theory and Applications of Graphs. Lecture Notes in Mathematics, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0070401

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08666-6

  • Online ISBN: 978-3-540-35912-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics