arXiv (All)
open access
Marked multi-colorings and marked chromatic polynomials of hypergraphs and subspace arrangements
We introduce the concepts of marked multi-colorings, marked chromatic polynomials, and marked (multivariate) independence series for hypergraphs. We show that the coefficients of the q-th power of the marked independence series of a hypergraph coincide with its marked chromatic polynomials in q, the
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
- A note on the multicolor size-Ramsey numbers of connected graphs#128283
- A Brooks-like result for graph powers $#983875
- Dynamic Coloring and Graph Squares of Regular Graphs#1233604
- The b-chromatic number of a graph#652634
- Disjoint unions and fixed-parameter algorithms for chromatic villainy#1297908
Record · ID 1199683
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