Introduction to combinatorics

Introduction to Combinatorics

Volumn , Issue , 2011, Pages 1-195

  Erickson, Martin J ^a  

^a TRUMAN STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85101054600     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9781118032640     Document Type: Book

References (58)

1. Aigner, M. (1979), Combinatorial Theory, Springer-Verlag, New York.
2. Alexanderson, G. L., Klosiniski, L. F., and Larson, L. C. (1985), The William Lowell Putnam Mathematical Competition, Problems and Solutions 1965-1984, Mathematical Association of America, Washington, D.C.
3. Alon, N. and Spencer, J. (1992), The Probabilistic Method, Wiley, New York.
4. Anderson, I. (1974), A First Course in Combinatorial Mathematics, Oxford University Press, New York.
5. Anderson, I. (1987), Combinatorics of Finite Sets, Oxford University Press, New York.
6. Aschbacher, M. (1994), Sporadic Groups, Cambridge University Press, New York.
7. Batten, L. M. (1986), Combinatorics of Finite Geometries, Cambridge University Press, New York.
8. Biggs, N. (1993), Algebraic Graph Theory, Cambridge University Press, New York.
9. Bollobâs, B. (1979), Graph Theory, Cambridge University Press, New York.
10. Bollobâs, B. (1985), Random Graphs, Academic Press, London.
11. Bollobâs, B. (1986), Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability, Cambridge University Press, New York.
12. Bollobâs, B. (ed.) (1991), Probabilistic Combinatorics and its Applications, American Mathematical Society, Boston.
13. Cameron, P. J. (1994), Combinatorics: Topics, Techniques, Algorithms, Cambridge University Press, New York.
14. Cameron, P. J. and van Lint, J. H. (1991), Designs, Graphs, Codes and Their Links, Cambridge University Press, New York.
15. Comtet, L. (1974), Advanced Combinatorics, D. Reidel, Dordrecht.
16. Conway, J. H. (1986), Atlas of Finite Groups, Maximal Subgroups, and Ordinary Characters for Simple Groups, Oxford University Press, New York.
17. Conway, J. H. and Sloane, N. J. A. (1988), Sphere Packings, Lattices, and Groups, Springer-Verlag, New York.
18. Furstenberg, H. (1981), Recurrence in Ergodic Theory and Combinatorial Number Theory, Princeton University Press, Princeton.
19. Gessel, I. and Rota, G.-C, eds. (1987), Classic Papers in Combinatorics, Birkhäuser, Boston.
20. Gleason, A. M., Greenwood, R. E., and Kelly, L. M. (1980), The William Lowell Putnam Mathematical Competition, Problems and Solutions 1938-1964, Mathematical Association of America, Washington, D.C.
21. Graham, R. L. (1981), Rudiments of Ramsey Theory, American Mathematical Society, Providence.
22. Graham, R. L., Knuth, D. E., and Patashnik, O. (1994), Concrete Mathematics, Addison-Wesley, New York.
23. Graham, R. L., Rothschild, B., and Spencer, J. (1990), Ramsey Theory, 2nd edn, Wiley, New York.
24. Greene, D. H. and Knuth, D. E. (1990), Mathematics for the Analysis of Algorithms, Birkhäuser, New York.
25. Halberstam, H. and Roth, K. (1983), Sequences, Springer-Verlag, New York.
26. Hall, M. (1986), Combinatorial Theory, 2nd edn, Wiley, New York.
27. Harary, F. (1969), Graph Theory, Addison-Wesley, Reading.
28. Harary, F. and Palmer, E. M. (1973), Graphical Enumeration, Academic Press, New York.
29. Hardy, G. and Wright, E. (1979), An Introduction to the Theory of Numbers, Clarendon Press, Oxford.
30. Hartsfield, N. and Ringel, G. (1994), Pearls in Graph Theory, Academic Press, New York.
31. Herstein, I. N. (1996), Abstract Algebra, 3rd edn, Prentice-Hall, Upper Saddle River.
32. Hill, R. (1986), A First Course in Coding Theory, Clarendon Press, Oxford.
33. Johnson, D. L. (1990), Presentations of Groups, Cambridge University Press, New York.
34. Johnsonbaugh, R. (1993), Discrete Mathematics, Macmillan Publishing Company, New York.
35. Keedwell, A. D. (ed.) (1991), Surveys in Combinatorics, Cambridge University Press, New York.
36. Klee, V. and Wagon, S. (1991), Old and New Unsolved Problems in Plane Geometry and Number Theory, Mathematical Association of America, Ithaca.
37. Lyndon, R. (1986), Groups and Geometry (repr. with corrections), Cambridge University Press, New York.
38. McEliece, R. (1977), The Theory of Information and Coding, Addison-Wesley, Reading.
39. MacWilliams, F. J. and Sloane, N. J. A. (1978), The Theory of Error-Correcting Codes, North-Holland, Amsterdam.
40. Michaels, J. G. and Rosen, K. H. (1991), Applications of Discrete Mathematics, McGraw-Hill, New York.
41. Nesetril, J. et al. (eds.) (1990), Mathematics of Ramsey Theory, Springer-Verlag, New York.
42. Niven, I., Zuckerman, H., and Montgomery, H. (1991), An Introduction to the Theory of Numbers, 5th edn, Wiley, New York.
43. Palmer, E. (1985), Graphical Evolution, Wiley, New York.
44. Pless, V. (1989), Introduction to the Theory of Error-correcting Codes, Wiley, New York.
45. Polya, G., Tarjan, E., and Woods, R. (1983), Notes on Introductory Combinatorics, Birkhäuser, Boston.
46. Roberts, F. S. (1984), Applied Combinatorics, Prentice-Hall, Englewood Cliffs.
47. Rotman, J. (1973), The Theory of Groups: An Introduction, 2nd edn, Allyn and Bacon, Boston.
48. Spencer, J. (1987), Ten Lectures on the Probabilistic Method, Society for Industrial and Applied Mathematics, Philadelphia.
49. Stanley, R. (1986), Enumerative Combinatorics, Wadsworth & Brooks/Cole Advanced Books & Software, Monterey.
50. Stanton, D. W. and White, O. E. (1986), Constructive Combinatorics, Springer-Verlag, New York.
51. Thompson, T. (1983), From Error-correcting Codes Through Sphere Packings to Simple Groups, Mathematical Association of America, Ithaca.
52. Tonchev, V. (1988), Combinatorial Configurations: Designs, Codes, Graphs, Wiley, New York.
53. Van Lint, J. H. and Wilson, R. M. (1992), A Course in Combinatorics, Cambridge University Press, New York.
54. Van Tilborg, H. C. A. (1988), An Introduction to Cryptology, Kluwer Academic Publishers, Norwell.
55. Wallis, W.D. (1988), Combinatorial Designs, Marcel Dekker, New York.
56. Welsh, D. (1988), Codes and Cryptography, Oxford University Press, New York.
57. Wilf, H.S. (1986), Algorithms and Complexity, Prentice-Hall, Englewood Cliffs.
58. Wilf, H. S. (1994), Generatingfunctionology, Academic Press, New York.