Skip to main content
SpringerLink
Log in

Enumeration of Latin rectangles via SDR’s

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorics and Graph Theory

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

Abstract

Presented here is a summary of the results on the theory of enumeration of Latin rectangles and their connection with the theory of SDR’s (Systems of Distinct Representatives). We shall touch only the salient features in the chronological development. in the last section we indicate how the problem of finding the number of Latin rectangles can be tackled, in general, with the help of SDR’s.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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. R. Alter, How many Latin squares are there?, Amer. Math. Monthly, 82 (1975), 632–634.

    Article  MathSciNet  MATH  Google Scholar 

  2. K.B. Athreya, C.R. Pranesachar and M.M. Singhi, On the number of Latin rectangles and chromatic polynomial of L(Kr,s), European Journal of Combinatorics (to appear).

    Google Scholar 

  3. P. Erdös and I. Kaplansky, The asymptotic number of Latin rectangles, Amer. Jour. Math., 68 (1946), 230–236.

    Article  MathSciNet  MATH  Google Scholar 

  4. J.E. Graver and M.E. Watkins, Combinatorics with Emphasis on the Theory of Graphs, Springer-Verlag, 1977.

    Google Scholar 

  5. M. Hall, Jr., An existence theorem for Latin squares, Bull. Amer. Math. Soc., 51(1945), 387–388.

    Article  MathSciNet  MATH  Google Scholar 

  6. S.M. Jacob, The enumeration of Latin rectangle of depth three, Proc. Lond. Math. Soc. (2), Vol. 31 (1930), 329–336.

    Article  MATH  Google Scholar 

  7. I. Kaplansky, On a generalisation of the “Probleme des rencontres”, Amer. Math., Monthly, 46 (1939), 159–161.

    Article  MathSciNet  MATH  Google Scholar 

  8. S.M. Kerawala, The enumeration of the Latin rectangle of depth three by means of of difference equation, Bull. Calcutta Math. Soc., 33(1941), 119–127.

    MathSciNet  MATH  Google Scholar 

  9. K. Lebensold, Disjoint matchings of graphs, J. Comb. Theory (B), 22 (1977), 207–210.

    Article  MathSciNet  MATH  Google Scholar 

  10. W.O.J. Moser, The number of very reduced 4xn Latin rectangles, Canad. J. Maths., 19(1967), 1011–1017.

    Article  MATH  Google Scholar 

  11. J. Riordan, Three-line Latin rectangles, Amer. Math. Monthly, 51(1944), 450–452.

    Article  MathSciNet  MATH  Google Scholar 

  12. J. Riordan, A recurrence relation for three-line Latin rectangles, Amer. Math. Monthly, 59(1952), 159–162.

    Article  MathSciNet  MATH  Google Scholar 

  13. J. Riordan, Three-line Latin rectangles, Amer. Math. Monthly, 53(1946), 18–20.

    Article  MathSciNet  MATH  Google Scholar 

  14. G.G. Rota, On the foundations of combinatorial theory I. Theory of Möbius functions, Z. Wahrscheinlichkeitstheorie, 2 (1964), 340–368.

    Article  MathSciNet  MATH  Google Scholar 

  15. H.J. Ryser, Combinatorial Mathematics, The Mathematical Association of America, 1963.

    Google Scholar 

  16. C.M. Stein, Asymptotic evaluation of the number of Latin rectangles, J. Comb. Theory (A), 25 (1978), 38–49.

    Article  MathSciNet  MATH  Google Scholar 

  17. J. Touchard, Sur un probleme de permutations, C.R.Acad.Sci. Paris, 198(1934), 631–633.

    MATH  Google Scholar 

  18. K. Yamamoto, On the asymptotic number of Latin rectangles, Japanese Journal of Math., 21 (1951), 113–119.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics, Indian Institute of Science, 560 012, Bangalore

    C. R. Pranesachar

Authors
  1. C. R. Pranesachar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Siddani Bhaskara Rao

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Pranesachar, C.R. (1981). Enumeration of Latin rectangles via SDR’s. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092284

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation