Strongly nice property and Schur positivity of graphs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Li, Ethan Y. H., Li, Grace M. X., Yang, Arthur L. B., Zhang, Zhong-Xue
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866910578762579968
author Li, Ethan Y. H.
Li, Grace M. X.
Yang, Arthur L. B.
Zhang, Zhong-Xue
author_facet Li, Ethan Y. H.
Li, Grace M. X.
Yang, Arthur L. B.
Zhang, Zhong-Xue
contents Motivated by the notion of nice graphs, we introduce the concept of strongly nice property, which can be used to study the Schur positivity of symmetric functions. We show that a graph and all its induced subgraphs are strongly nice if and only if it is claw-free, which strengthens a result of Stanley and provides further evidence for the well-known conjecture on the Schur positivity of claw-free graphs. As another application, we solve Wang and Wang's conjecture on the non-Schur positivity of squid graphs $Sq(2n-1;1^n)$ for $n \ge 3$ by proving that these graphs are not strongly nice.
format Preprint
id arxiv_https___arxiv_org_abs_2408_15074
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Strongly nice property and Schur positivity of graphs
Li, Ethan Y. H.
Li, Grace M. X.
Yang, Arthur L. B.
Zhang, Zhong-Xue
Combinatorics
05E05, 06A07
Motivated by the notion of nice graphs, we introduce the concept of strongly nice property, which can be used to study the Schur positivity of symmetric functions. We show that a graph and all its induced subgraphs are strongly nice if and only if it is claw-free, which strengthens a result of Stanley and provides further evidence for the well-known conjecture on the Schur positivity of claw-free graphs. As another application, we solve Wang and Wang's conjecture on the non-Schur positivity of squid graphs $Sq(2n-1;1^n)$ for $n \ge 3$ by proving that these graphs are not strongly nice.
title Strongly nice property and Schur positivity of graphs
topic Combinatorics
05E05, 06A07
url https://arxiv.org/abs/2408.15074