Graph colorings and related symmetric functions: Ideas and applications: A description of results, interesting applications, & notable open problems

Discrete Mathematics

Volumn 193, Issue 1-3, 1998, Pages 267-286

  Stanley, Richard P ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000668840     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00146-0     Document Type: Article

References (39)

1. M. Aissen, I.J. Schoenberg, A. Whitney, On generating functions of totally positive sequences, I, J. Analyse Math. 2 (1952) 93-103.
2. T. Ando, Totally positive matrices, Linear Algebra Appl. 90 (1987) 165-219.
3. C. Berge, Graphs and Hypergraphs, 2nd ed., North-Holland, Amsterdam, 1976.
4. A. Björner, Subspace arrangements, in: Proc. 1st European Congress of Mathematics, Paris, 1992, Birkhäuser, Basel, 1994, pp. 321-370.
5. A. Björner, L. Lovász, Linear decision trees, subspace arrangements and Möbius functions, J. Amer. Math. Soc. 7 (1994) 677-706.
6. A. Björner, L. Lovász, A. Yao, Linear decision trees: volume estimates and topological bounds, in: Proc. 24th Ann. ACM Symp. on Theory of Computing, ACM Press, New York, 1992, pp. 170-177.
7. A. Björner, V. Welker, The homology of 'k-equal' manifolds and related partition lattices, Adv. Math. 110 (1995) 277-313.
8. F. Brenti, Unimodal, log-concave and Pólya frequency sequences in combinatorics, Mem. Amer. Math. Soc. 81(413) (1989).
9. T. Brylawski, J. Oxley, The Tutte polynomial and its applications, in: N. White (Ed.), Matroid Applications, Encyclopedia of Mathematics and its Applications, vol. 40, Cambridge University Press, Cambridge, 1992, pp. 123-225.
10. T.Y. Chow, The path-cycle symmetric function of a digraph, Adv. Math. 118 (1996) 71-98.
11. F. Chung, R. Graham, On the cover polynomial of a digraph, J. Combin. Theory Ser. B 65 (1995) 273-290.
12. P.C. Fishburn, Interval Graphs and Interval Orders, Wiley, New York, 1985.
13. D.C. Fisher, A. E. Solow, Dependence polynomials, Discrete Math. 82 (1990) 251-258.
14. V. Gasharov, Theory and applications of symmetric Functions, Ph.D. Thesis, Brandeis University, 1994.
15. V. Gasharov, Incomparability graphs of (3 + 1)-free posets are s-positive, Discrete Math. 157 (1996) 193-197.
16. I. Gessel, G.X. Viennot, Determinants, paths, and plane partitions, preprint, 28 July 1989.
17. C.D. Godsil, Algebraic Combinatorics, Chapman & Hall, New York, 1993.
18. J. Griggs, Problems on chain partitions, Discrete Math. 72 (1988) 157-162.
19. Y.O. Hamidoune, On the numbers of independent k-sets in a claw free graph, J. Combin. Theory Ser. B 50 (1990) 241-244.
20. O.J. Heilmann, E.H. Lieb, Theory of monomer-dimer systems, Commun. Math. Phys. 25 (1972) 190-232.
21. C. Hoede, X. Li, Clique polynomials and independent set polynomials of graphs, Discrete Math. 125 (1994) 219-228.
22. D.E. Knuth, Two notes on notation, Amer. Math. Monthly 99 (1992) 403-422.
23. T.Y. Lam, Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture of Snapper, J. Pure Appl. Algebra 10 (1977) 81-94.
24. R.A. Liebler, M.R. Vitale, Ordering the partition characters of the symmetric group, J. Algebra 25 (1973) 487-489.
25. L. Lovász, Combinatorial Problems and Exercises, North-Holland, Amsterdam, 1979.
26. I.G. Macdonald, Symmetric Functions and Hall Polynomials, Oxford University Press, Oxford, 1979.
27. A. Magid, Enumeration of convex polyominoes. A generalization of the Robinson-Schensted correspondence and the dimer problem, Ph.D. Thesis, Brandeis University, October, 1992.
28. W. Mantel, Problem 28, solution by H. Gouwentak, W. Mantel, J. Teixeirade Mattes, F. Schuh, W.A. Wythoff, Wiskundige Opgaven 10 (1907) 60-61.
29. R.C. Read, A large family of chromatic polynomials, in: C.C. Cadogan (Ed.), Proc. 3rd Caribbean Conf. on Combinatorics and Computing, University of the West Indies Press, Barbados, 1981, pp. 23-41.
30. B.E. Sagan, The Symmetric Group, Wadsworth & Brooks/Cole, Pacific Grove, CA, 1991.
31. R. Simion, A multiindexed Sturm sequence of polynomials and unimodality of certain combinatorial sequences, J. Combin. Theory Ser A 36 (1984) 15-22.
32. R. Stanley, Generating functions, in: G.-C. Rota (Ed.), Studies in Combinatorics, Mathematical Association of America, 1978, pp. 100-141.
33. R. Stanley, Combinatorics and Commutative Algebra, Progress in Mathmatics, vol. 41, Birkhäuser, Boston, 1983; second ed., 1996.
34. R. Stanley, Enumerative Combinatorics, vol. 1, Wadsworth and Brooks/Cole, Pacific Grove, CA, 1986; second printing, Cambridge University Press, Cambridge, 1996.
35. R. Stanley, A symmetric function generalization of the chromatic polynomial of a graph, Adv. Math. 111 (1995) 166-194.
36. R. Stanley, J.R. Stembridge, On immanants of Jacobi-Trudi matrices and permutations with restricted positions, J. Combin. Theory Ser. A 62 (1993) 261-279.
37. S. Sundaram, M. Wachs, The homology representations of the k-equal partition lattice, Trans. Amer. Math. Soc. 349 (1997) 935-954.
38. J. Tits, Buildings of Spherical Type and Finite BN-Pairs, Lecture Notes in Mathematics, vol. 386, Springer, Berlin, 1974.
39. G.X. Viennot, Heaps of pieces, I: basic definitions and combinatorial lemmas, in: G. Labelle, P. Leroux (Eds.), Combinatoire énumerative, Lecture Notes in Mathematics, vol. 1234, Springer, Berlin, 1986, pp. 321-350.