arXiv (All)
open access
The Game Chromatic Number of Complete Multipartite Graphs with Singletons and Large Parts
We study the game chromatic number of complete multipartite graphs whose parts are either singletons or are of size at least four. Building on the work of PawełObszarski et al., we give a formula in terms of the ordered part sizes, and the number of singleton parts.
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
- The Game Chromatic Number of Complete Multipartite Graphs#1296325
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- $2$-large sets are sets of nil-Bohr recurrence#1328195
- Polychromatic 2-colorings with Bounded Discrepancy for Triangulations#1106273
- The b-chromatic number of a graph#652634
Record · ID 1296515
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