arXiv (All)
open access
Minimal Cayley graphs with large chromatic number
Resolving Babai's minimal Cayley graph problem, we construct finite minimal Cayley graphs with arbitrarily large chromatic number.
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
- Spectral Extremal Graphs without a $K_k$-Factor#1035928
- Schur positivity from signed elementary expansions: clique-spiders and spiders $S(a,b,2)$#1326388
- Cayley Graph Optimization for Scalable Multi-Agent Communication Topologies#10306
- A Chvátal-type codegree condition for Hamiltonian cycles in $k$-uniform hypergraphs#985948
- The edge spectral extremal problem for $kK_3$ in nonzero residue classes#1216397
Record · ID 1342578
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