arXiv (All)
open access
Schur positivity from signed elementary expansions: clique-spiders and spiders $S(a,b,2)$
Determining when the chromatic symmetric function of a graph is Schur positive is a central problem in algebraic combinatorics. Elementary expansions can help answer this question, but negative coefficients obstruct a direct positivity argument. We develop methods for proving Schur positivity from s
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Spectral Extremal Graphs without a $K_k$-Factor#1035928
- Minimal Cayley graphs with large chromatic number#1342578
- A sharp bound for the least signless Laplacian eigenvalue of triangle-free graphs#1325399
- A Polynomially Searchable Exponential Neighbourhood for Graph Colouring#824269
- Counting List Colorings of Unlabeled Graphs#1014472
Record · ID 1326388
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive