Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph

Combinatorica

Volumn 16, Issue 3, 1996, Pages 383-397

  Kahale, Nabil ^a   Schulman, Leonard J ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041350908     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01261322     Document Type: Article

References (23)

1. N. ALON: The number of spanning trees in regular graphs, Random Structures & Algorithms 1 (1990), no. 2, 175-181.
2. N. ALON, and J. H. SPENCER: The Probabilistic Method, Wiley, 1992.
3. N. ALON, and N. KAHALE: personal communication, August 1993.
4. J. D. ANNAN: A randomized approximation algorithm for counting the number of forests in dense graphs, Combinatorics, Probability and Computing 3 (1994), no. 3, 273-283.
5. N. BIGGS: Algebraic Graph Theory, Cambridge University Press, 1974.
6. J. A. BONDY, and U. S. R. MURTY: Graph Theory and Applications, American Elsevier, 1976.
7. H. CHERNOFF: A measure for asymptotic efficiency of tests of a hypothesis based on the sum of observations, Ann. Math. Statist., 23 (1952), 493-507.
8. P. ERDOS, and H. SACHS: Regulare Graphe gegebener Taillenweite mit minimaler Knotenzahl, Wiss. Z. Univ. Halle-Wittenberg, Math.-Nat., 12 (1963), no. 3, 251-258.
9. W. GODDARD, C. KENYON, V. KING, and L. J. SCHULMAN: Optimal Randomized Algorithms for Local Sorting and Set-Maxima, SIAM J. Computing, 22 (1993), no. 2, 272-283; Also in: Optimal Randomized Algorithms for Local Sorting and Set-Maxima, W. Goddard, V. King and L. Schulman, Proc. Twenty Second Annual ACM Symp. on Theory of Computing (1990), 45-53.
10. W. GODDARD, C. KENYON, V. KING, and L. J. SCHULMAN: Optimal Randomized Algorithms for Local Sorting and Set-Maxima, SIAM J. Computing, 22 (1993), no. 2, 272-283; Also in: Optimal Randomized Algorithms for Local Sorting and Set-Maxima, W. Goddard, V. King and L. Schulman, Proc. Twenty Second Annual ACM Symp. on Theory of Computing (1990), 45-53.
11. F. JAEGER, D. L. VERTIGAN, and D. J. A. WELSH: On the Computational Complexity of the Jones and Tutte Polynomials, Proceedings of the Cambridge Philosophical Society, vol. 108 (1990), 35-53.
12. R. GRAHAM, F. YAO, and A. YAO: Information Bounds are Weak in the Shortest Distance Problem, J. ACM, 27 (1980), 428-444.
13. N. KAHALE: Expander Graphs. PhD thesis, Massachusetts Institute of Technology, September 1993. MIT Laboratory for Computer Science, Technical Report MIT/LCS/TR-591.
14. N. LINIAL: Hard enumeration problems in geometry and combinatorics, SIAM J. on Algebraic and Discrete Methods, 7 (1986), 331-335.
15. A. LUBOTZKY, R. PHILLIPS, and P. SARNAK: Ramanujan graphs, Combinatorica, 8 (1988), no. 3, 261-277.
16. M. MARCUS, and H. MINC: A Survey of Matrix Theory and Matrix Inequalities, Prindle Weber and Schmidt 1964, Dover 1992, §II.4.1.7 114.
17. G. A. MARGULIS: Explicit group-theoretical constructions of combinatorial schemes and their applications to the design of expanders and concentrators, Problemy Peredači Informacii, 24 (1988), no. 1, 51-60.
18. B. D. MCKAY: Spanning trees in regular graphs, Euro. J. Combinatorics, 4 (1983), 149-160.
19. U. MANBER, and M. TOMPA: The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem, SIAM J. Comp., 13 (1984), 109-115.
20. R. P. STANLEY: Enumerative Combinatorics, Wadsworth & Brooks/Cole, 1986.
21. R. P. STANLEY: Acyclic Orientations of Graphs, Discrete Mathematics, 5 (1973), 171-178.
22. L. TAKÁCS: On the Number of Distinct Forests, SIAM J. Discrete Math, Vol. 3, No. 4, Nov. 1990, 574-581.
23. J. S. VITTER, and P. FLAJOLET: Average-case analysis of algorithms and data structures, Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity, MIT press (edited by J. Van Leeuwen), 1990, 433-524.