Metraipolis › archive › dc_55aaec3bfb28

Stronger Spectral Bound for Clique Number — arXiv:2610.21388

Source: arXiv (en)
Original: https://arxiv.org/abs/2610.21388
License (as archived): CC0-1.0
Archived: 2026-10-16T10:33:34.217Z
SHA-256 of the archived text: 1d373a0fec9ab80a796207fa6d6cf5c9d1c0a15926d29c343aa39301c58b7547
Stable URL of this page: https://metraipolis.com/documento/dc_55aaec3bfb28

How to cite

Stronger Spectral Bound for Clique Number — arXiv:2610.21388 — arXiv (en), https://arxiv.org/abs/2610.21388 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_55aaec3bfb28 (Metraipolis archive dc_55aaec3bfb28, sha256 1d373a0fec9ab80a796207fa6d6cf5c9d1c0a15926d29c343aa39301c58b7547)

BibTeX

@misc{dc55aaec3bfb28,
  title = {Stronger Spectral Bound for Clique Number — arXiv:2610.21388},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21388},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_55aaec3bfb28; sha256 1d373a0fec9ab80a796207fa6d6cf5c9d1c0a15926d29c343aa39301c58b7547},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21388. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 this paper, we present an infinite family of graphs for which the Elphick and Wocjan conjecture is true. We find a stronger spectral lower bound for the clique number for this family of graphs.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.21388 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:50:47.580Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).