arXiv (All)
open access
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Using spectral and polynomial methods, we show several sharp spectral bounds for the clique and chromatic numbers of graph powers that only use spectral information from the original graph. In particular, we strengthen earlier spectral-radius estimates to obtain an asymptotically sharp colouring bou
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
- Sparse chromatic graphs and the complete-graph triangle bound#1062147
- Multiset Colorings of Random Graphs Across Density Regimes#1049104
- Bounded chromatic number of graphs with small clique number and large minimum degree#1050283
- Property B for random non-uniform hypergraphs#1216754
- A note on vertex-critical induced subgraphs of shift graphs#1052081
Record · ID 1298348
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