Hadamard determinants Möbius functions, and the chromatic number of a graph
HTML articles powered by AMS MathViewer
- by Herbert S. Wilf PDF
- Bull. Amer. Math. Soc. 74 (1968), 960-964
References
- G. F. Clements and B. Lindström, A sequence of $(\pm 1)-$determinants with large values, Proc. Amer. Math. Soc. 16 (1965), 548–550. MR 178001, DOI 10.1090/S0002-9939-1965-0178001-X
- B. Lindström and H.-O. Zetterström, A combinatorial problem in the $k$-adic number system, Proc. Amer. Math. Soc. 18 (1967), 166–170. MR 207568, DOI 10.1090/S0002-9939-1967-0207568-X 3. G. Pólya and G. Szegö, Aufgaben und Lehrsätze aus der Analysis, Berlin, 1964.
- Gian-Carlo Rota, On the foundations of combinatorial theory. I. Theory of Möbius functions, Z. Wahrscheinlichkeitstheorie und Verw. Gebiete 2 (1964), 340–368 (1964). MR 174487, DOI 10.1007/BF00531932 5. G. D. Birkhoff, A determinant formula for the number of ways of coloring a map, Ann. of Math. II Ser. 14 (1913), 42-46.
Additional Information
- Journal: Bull. Amer. Math. Soc. 74 (1968), 960-964
- DOI: https://doi.org/10.1090/S0002-9904-1968-12104-4
- MathSciNet review: 0229532