arXiv (All)
open access
Stronger Spectral Bound for Clique Number
Given an integer $k$, deciding whether a graph has a clique of size $k$ is an NP-complete problem. Wilf's inequality provides a spectral lower bound for the clique number of a graph. Strengthening this bound, Elphick and Wocjan proposed a conjecture in 2018 using positive adjacency eigenvalues. In t
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 Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- Greedy Coloring and Simple Exponential Strengthenings of Brooks-Type Theorems#1325270
- Spectral extremal hypergraphs without long Berge cycles#1051523
- Minimum-excess coverings of complete graphs by 3-, 4-, and 5-cliques#1142646
- Large induced subgraphs with $k$ vertices of maximum degree#822116
Record · ID 1356724
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