Skip to main content
Log in

On the problem of reconstructing a tournament from subtournaments

  • Published:
Monatshefte für Mathematik Aims and scope Submit manuscript

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. L. Beineke andF. Harary: The maximum number of strongly connected subtournaments. Canad. Math. Bull.,8 (1965), 491–498.

    Google Scholar 

  2. F. Harary: On the reconstruction of a graph from a collection of subgraphs. A chapter in Graph Theory and its Applications, Prague, 1964, pp. 47–52.

  3. F. Harary: The theory of tournaments: a miniature mathematical system. Colloq. Math.,15 (1966), 159–165.

    Google Scholar 

  4. F. Harary andL. Moser: The theory of round robin tournaments. Amer. Math. Monthly73 (1966), 231–246.

    Google Scholar 

  5. F. Harary, R. Norman, andD. Cartwright: Structural Models: an introduction to the theory of directed graphs. New York, 1965, esp. Chapter 11.

  6. H. Izbicki: Reguläre Graphen beliebigen Grades mit vorgegebenen Eigenschaften. Monatsh. für Math.,64 (1960), 15–21.

    Google Scholar 

  7. P. J. Kelly: A congruence theorem for trees. Pacific J. Math.7 (1957), 961–968.

    Google Scholar 

  8. S. M. Ulam: A collection of mathematical problems. New York, 1960, p. 29.

Download references

Author information

Authors and Affiliations

Authors

Additional information

With 7 Figures

Work supported in part by the U. S. Air Force Office of Scientific Research under grant AF-AFOSR-754-65.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Harary, F., Palmer, E. On the problem of reconstructing a tournament from subtournaments. Monatshefte für Mathematik 71, 14–23 (1967). https://doi.org/10.1007/BF01299955

Download citation

  • Received:

  • Issue Date:

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

Navigation