arXiv (All)
open access
Counterexamples to a conjecture and improved bounds for bipanchromatic colorings
We study the bipanchromatic number $χ_B$, introduced by Lalou et al. (Discrete Appl. Math. 391 (2026), 511-522) as the maximum number of colors in a panchromatic hypergraph coloring where every color appears at least twice. They show that merging uniquely occurring colors in a maximum panchromatic c
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
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- Marked multi-colorings and marked chromatic polynomials of hypergraphs and subspace arrangements#1199683
- A note on the multicolor size-Ramsey numbers of connected graphs#128283
- Disjoint unions and fixed-parameter algorithms for chromatic villainy#1297908
- Majority C-coloring in Cartesian products#780968
Record · ID 1402521
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