arXiv (All)
open access
The $k$-color poset Ramsey number of the diamond is $2k$
The $k$-color Ramsey number of a poset $P$ is the smallest dimension $d$ such that any $k$-coloring of the $d$-dimensional Boolean lattice contains a monochromatic induced copy of $P$. For $ j\ge 2$ the $j$-diamond is the poset that consists of a maximum element, a minimum element and an antichain o
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 generalized Mycielski graphs of paths and cycles#924181
- The game chromatic number of generalized Mycielski graphs of paths and cycles#919950
- The biwheel conjecture for braces#1297307
- Majority C-coloring in Cartesian products#780968
- Majority C-coloring in Cartesian products#779593
Record · ID 1355463
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