Description
Chair: Sejeong Bang
R. Stanley introduced the chromatic symmetric functions of a graph $G$. This definition was later refined by J. Shareshian and M. Wachs, where a parameter $q$ is introduced in the definition of chromatic uasisymmetric functions. In this talk, we discuss two separate results and their connection: (1) a Hall-Littlewood expansion of the chromatic quasisymmetric functions (2) $e$-positivity of the...
The numbers $n!$ and $(n+1)^{n-1}$ are ubiquitous in combinatorics. Each number counts number of permutations and parking functions, respectively. I will discuss their $(q,t)$-generalizations and further generalization to symmetric functions, namely the modified Macdonald polynomials $\widetilde{H}_\mu$ and $\nabla e_n$. Then I will discuss a recent conjecture involving these two symmetric...
A proper coloring of a graph is proper conflict-free if every non-isolated vertex $v$ has a neighbor whose color is unique in the neighborhood of $v$.
A proper coloring of a graph is odd if for every non-isolated vertex $v$, there is a color appearing an odd number of times in the neighborhood of $v$.
For an integer $k$, the PCF $k$-Coloring problem asks whether an input graph admits a...
