A large class of conjecturally stable chromatic symmetric functions
From MaRDI portal
Publication:6630481
Recommendations
Cites work
- A proof of the shuffle conjecture
- A symmetric function generalization of the chromatic polynomial of a graph
- Chromatic quasisymmetric functions
- Graphs with equal chromatic symmetric functions
- Interlacing families. II: Mixed characteristic polynomials and the Kadison-Singer problem
- Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids
- Logarithmic concavity of Schur and related polynomials
- Lorentzian polynomials
- Multivariate stable polynomials: theory and applications
- On immanants of Jacobi-Trudi matrices and permutations with restricted position
- The Lee--Yang and Pólya--Schur programs. I: Linear operators preserving stability
- The Lee‐Yang and Pólya‐Schur programs. II. Theory of stable polynomials and applications
This page was built for publication: A large class of conjecturally stable chromatic symmetric functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6630481)