A walk through combinatorics: An introduction to enumeration and graph theory, second edition

A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory, Second Edition

Volumn , Issue , 2006, Pages 1-470

  Bóna, Miklós ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967360387     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/6177     Document Type: Book

References (44)

1. Agrawal, M., Kayal, N., Saxena, N. (2004) "PRIMES is in P." Annals of Mathematics, 160, 781-793.
2. Albert, M., Elder, M., Rechnitzer, A., Westcott, P., and Zabrocki, M. (2006) "A lower bound on the growth rate of the class of 4231 avoiding permutations", Adv. Appi. Math. 36 vol. 2, 96-105.
3. Alon, N., Spencer, J. (2000) "The Probabilistic Method", second edition, Wiley-Interscience Series in Discrete Mathematics and Optimization. A Wiley-Interscience Publication. John Wiley and Sons, Inc.
4. Andrews, G. E. (1976) "The Theory of Partitions", Encyclopedia of Mathematics and Its Applications, vol. 2, Addison-Wesley.
5. Bollobas, B. (1978) "Extremal Graph Theory". London Mathematical Society Monographs, 11. Academic Press, Inc.
6. Bóna, M. (2005) "Introduction to Enumerative Combinatorics" McGraw-Hill.
7. Bóna, M. (2004) "Combinatorics of Permutations" CRC Press - Chapman Hall.
8. Bóna, M. (1998) "The permutation classes equinumerous to the smooth class". Electron. J. Combin. 5, no. 1.
9. Bóna, M., Simion, R. (2000) "A self-dual poset on objects counted by the Catalan numbers and a type-B analogue", Discrete Math. 220, no. 1-3, 3549.
10. Bóna M., MacLennan, A., White, D., (2000) "Permutations with roots", Random Structures and Algorithms, 17, no. 2, 157-167.
11. Bóna, M (1997) "A new proof of the formula for the number of the 3x3 magic squares", Math. Magazine 70, 201-203.
12. Brenti, F. (1997) "Unimodal, log-concave and Pólya frequency sequences in combinatorics," Mem. Amer. Math. Soc. 81, no. 413.
13. Cook, S. (1971) "The complexity of theorem proving procedures" Proceedings of the third ACM Symposium, ACM, 151-158.
14. Cormen, T, Leiserson, C, Rivest, R., Stein, C. (2002) "Introduction to Algorithms", McGraw-Hill, second edition.
15. Garey, M. D., Johnson, S. (1979) "Computers and Intractability; A guide to the theory of NP-completeness. W. H. Freeman and Co.
16. Gordon, H. (1997) "Discrete Probability", Springer.
17. Graham, L., Rothschild, B., Spencer, J., (1990) "Ramsey Theory", Wiley Interscience, second edition.
18. Greene, C, Bogarth, K. P., Kung, J. (1990) "The impact of the chain decomposition theorem on classical combinatorics. The Dilworth theorems", 19-29, Contemp. Mathematicians, Birkhauser.
19. Harary, F., Palmer, E. M. (1973) "Graphical Enumeration", Academic Press, 1973.
20. Kaiser, T., Klazar, M. (2003) On growth rates of hereditary permutation classes, Electr. J. Combinatorics 9 vol. 2, R10.
21. Krattenthaler, C. (1995) "The major counting of nonintersecting lattice paths and generating functions for tableaux", Mem. Amer. Math. Soc. 115, no. 552.
22. Landman, B., Robertson, A., (2004) "Ramsey Theory on the Integers", American Mathematical Society.
23. Lovasz, L. (1994) "Combinatorial Problems and Exercises", Elsevier; Akademiai Kiado (Publishing House of the Hungarian Academy of Sciences), second edition.
24. Lovasz, L., Plummer, M. D. (1986) "Matching Theory", Akademiai Kiado (Publishing House of the Hungarian Academy of Sciences).
25. MacMahon, P. A. (1916) "Combinatorial Analysis", vols. 1-2, Cambridge, 1916. (reprinted by Chelsea, New York, 1960).
26. Marcus, A., Tardos, G. (2004) Excluded Permutation Matrices and the Stanley-Wilf conjecture, J. Combin. Theory Ser. A 107 no. 1, 153-160.
27. Pach, J., Agarwal, P., (1995) "Combinatorial geometry" Wiley Interscience.
28. Papadimitriou, C. H. (1994) "Computational Complexity", Addison-Wesley.
29. Pittel, B. (1999) Confirming two conjectures about the integer partitions. J. Combin. Theory Ser. A 88 no. 1, 123-135.
30. Recski, A. (1989) "Matroid Theory and ts Applications in Electric Network Theory and in Statics." Springer-Verlag; Akademiai Kiado (Publishing House of the Hungarian Academy of Sciences).
31. Reingold, O. (2005) "Undirected ST-connectivity in log-space." STOC’05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 376-385, ACM.
32. Sagan, B. E. (1998) "Unimodality and the reflection principle", Ars Combin. 48, 65-72.
33. Simion, R., Ullman, D. (1991) "On the structure of the lattice of noncrossing partitions", Discrete Math. 98, no. 3, 193-206.
34. Sipser, M. (2005) "Introduction to the Theory of Computation" Course Technology; second edition.
35. Stanley, R. (1983) "Combinatorics and Commutative Algebra", Progress in Mathematics 41, Birkhauser.
36. Stanley, R. (1973) "Acyclic orientations of graphs", Discrete Math. 5, 171178.
37. Stanley, R. (1997) "Enumerative Combinatorics", vol. 1, Cambridge Univer-sity Press, second edition.
38. Stanley, R. (1999) "Enumerative Combinatorics", vol. 2, Cambridge University Press.
39. Toth, C, Valtr, P. (2005) The Erds-Szekeres theorem, upper bounds and generalizations, Discrete and Computational Geometry - Papers from the MSRI Special Program (J. E. Goodman et al. eds.) 52, 557-568.
40. Trotter, W. T. (1992) "Combinatorics and Partially Ordered Sets. Dimension Theory", Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press.
41. West, D. (2001) "Introduction to Graph Theory", Prentice Hall, second edition.
42. West, J. (1996) "Generating trees and forbidden subsequences". Proceedings of the 6th Conference on Formal Power Series and Algebraic Combinatorics (New Brunswick, NJ, 1994). Discrete Math. 157, no. 1-3, 363-374.
43. Wilf, H. (1994) "Generatingfunctionology", Academic Press, second edition.
44. Wilf, H. (2002) "Algorithms and Complexity". AK Peters, second edition.