Graph colorings and related symmetric functions: ideas and applications: A description of results, interesting applications, and notable open problems.
From MaRDI portal
Publication:1584467
DOI10.1016/S0012-365X(98)00146-0zbMath1061.05508MaRDI QIDQ1584467
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Partial orders, general (06A06) Symmetric functions and generalizations (05E05) Coloring of graphs and hypergraphs (05C15)
Related Items
Chromatic quasisymmetric functions, The \(k\)-fractal of a simplicial complex, Chain enumeration, partition lattices and polynomials with only real roots, Universal Tutte polynomial, Plurigraph coloring and scheduling problems, Generalized Dehn-Sommerville relations for hypergraphs, Building graphs whose independence polynomials have only real roots, Embeddings of Schur functions into types \(B/C/D\), Generalised chromatic polynomials of graphs from heaps of pieces, A survey on recurrence relations for the independence polynomial of hypergraphs, Plethysms of chromatic and Tutte symmetric functions, A Robinson-Schensted algorithm for a class of partial orders, Multicomplexes and polynomials with real zeros, Spiders and their kin: an investigation of Stanley's chromatic symmetric function for spiders and related graphs, Link complexes of subspace arrangements, The roots of the independence polynomial of a clawfree graph, A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function, Chromatic polynomial, \(q\)-binomial counting and colored Jones function, More connections between the matching polynomial and the chromatic polynomial, A note on distinguishing trees with the chromatic symmetric function, Characteristic and Ehrhart polynomials, Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs, A combinatorial formula for the Schur coefficients of chromatic symmetric functions, A deletion-contraction relation for the chromatic symmetric function, Total nonnegativity and (3+1)-free posets, A counterexample to a conjecture on Schur positivity of chromatic symmetric functions of trees, Chromatic symmetric functions via the group algebra of \(S_n\), The \(e\)-positivity of two classes of cycle-chord graphs, The Potts model and chromatic functions of graphs, Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function, The Go polynomials of a graph., New invariants for permutations, orders and graphs, Symmetric functions in noncommuting variables, On the algebraic complexity of some families of coloured Tutte polynomials, The Equivalence of Two Graph Polynomials and a Symmetric Function, The chromatic symmetric functions of trivially perfect graphs and cographs, Chromatic symmetric functions of hypertrees, Chromatic symmetric functions and \(H\)-free graphs, A characterization of \((3+1)\)-free posets, Structure and enumeration of \((3+1)\)-free posets, The independence polynomial of rooted products of graphs, A chromatic symmetric function in noncommuting variables, Chromatic symmetric functions in noncommuting variables revisited, Tutte polynomials for directed graphs, Schur and \(e\)-positivity of trees and cut vertices, Chromatic symmetric function of graphs from Borcherds algebras, LLT polynomials, chromatic quasisymmetric functions and graphs with cycles, Modular relations of the Tutte symmetric function, Unnamed Item, The twinning operation on graphs does not always preserve \(e\)-positivity, Classes of graphs with \(e\)-positive chromatic symmetric function, Isomorphism of weighted trees and Stanley's isomorphism conjecture for caterpillars, Resolving Stanley's \(e\)-positivity of claw-contractible-free graphs, Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function, A weighted graph polynomial from chromatic invariants of knots, On Stanley's chromatic symmetric function and clawfree graphs, Sinks in acyclic orientations of graphs, A Complete Multipartite Basis for the Chromatic Symmetric Function, The \(e\)-positivity and Schur positivity of some spiders and broom trees, Toeplitz minors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A multiindexed Sturm sequence of polynomials and unimodality of certain combinatorial sequences
- Problems on chain partitions
- Buildings of spherical type and finite BN-pairs
- Young diagrams, Schur functions, the Gale-Ryser theorem and a conjecture or Snapper
- Clique polynomials and independent set polynomials of graphs
- Problems in algebraic combinatorics
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- A symmetric function generalization of the chromatic polynomial of a graph
- On the numbers of independent \(k\)-sets in a claw free graph
- The homology of ``\(k\)-equal manifolds and related partition lattices
- Combinatorics and commutative algebra.
- On the cover polynomial of a digraph
- The path-cycle symmetric function of a digraph
- Incomparability graphs of \((3+1)\)-free posets are \(s\)-positive
- Ordering the partition characters of the symmetric group
- Betweenness, orders and interval graphs
- Theory of monomer-dimer systems
- Dependence polynomials
- On the generating functions of totally positive sequences. I
- The homology representations of the š-equal partition lattice
- Two Notes on Notation
- Unimodal, log-concave and PĆ³lya frequency sequences in combinatorics
- Linear Decision Trees, Subspace Arrangements, and Mobius Functions
- Cohomology of Smooth Schubert Varieties in Partial Flag Manifolds
- Totally positive matrices