arXiv (All)
open access
Hedetniemi's Conjecture for Uncountable Complementary Graphs
We study the complementary version of Hedetniemi's problem for infinite graphs. We prove that if a graph $G$ and its complement $\overline{G}$ are both uncountably chromatic while their categorical product is countably chromatic, then $|V(G)|=ω_1$. Assuming $\diamondsuit$, we construct a graph $G$ 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
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- On the odd independence number of the Queen graph#1233951
- Graph Puzzles III.1: A Proof of Sabidussi's Compatibility Conjecture#1215429
- Ramsey multiplicity and extremal colorings for odd cycles#1136549
- Infinitely many size-Ramsey numbers of $k$-uniform relaxed $\ell$-trees are not polynomial#971390
Record · ID 1217762
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