Hadamard determinants Möbius functions, and the chromatic number of a graph

DOI10.1090/S0002-9904-1968-12104-4zbMath0172.01602MaRDI QIDQ5559557

Herbert S. Wilf

Publication date: 1968

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

combinatorics

Related Items

Factoring the Dedekind-Frobenius determinant of a semigroup ⋮ Tensor envelopes of regular categories ⋮ On Smith's determinant ⋮ A bibliography on chromatic polynomials ⋮ Determinant and inverse of join matrices on two sets ⋮ Hyperdeterminants on semilattices ⋮ On the positive definiteness and eigenvalues of meet and join matrices ⋮ The equivalence of semidefinite relaxations of polynomial 0-1 and \(\pm 1\) programs via scaling ⋮ Explicit expressions of Smith's determinant on a poset ⋮ A construction of semisimple tensor categories ⋮ GCD matrices, posets, and nonintersecting paths ⋮ Properties of some arithmetic functions ⋮ Total nonnegativity of GCD matrices and kernels ⋮ TWO APPROACHES TO MÖBIUS INVERSION ⋮ On meet matrices on posets ⋮ A semidefinite programming hierarchy for packing problems in discrete geometry ⋮ Some properties of row-adjusted meet and join matrices ⋮ Communication complexity in lattices

Cites Work

• Unnamed Item
• A Sequence of (± 1)-Determinants with Large Values
• A Combinatorial Problem in the k-Adic Number System
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]