Chromatic symmetric functions and combinatorial polynomials are central constructs in modern algebraic combinatorics, extending classical graph invariants into rich algebraic frameworks. Originating ...

Graph polynomials serve as robust algebraic encodings of the intricate combinatorial properties inherent to graphs. At the heart of this discipline lies the Tutte polynomial, an invariant that not ...

Mathematics of Computation, Vol. 34, No. 150 (Apr., 1980), pp. 441-463 (23 pages) Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are ...

We give explicit representations of the coefficients of p-valent functions which are polynomials of univalent functions of the class S. With their help we prove the Goodman conjecture in the special ...