{
  "abstract": "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.21388",
  "author_total": 4,
  "authors": [
    {
      "name": "Hareshkumar Jadav"
    },
    {
      "name": "Sudipta Mallik"
    },
    {
      "name": "Akhilesh Panchangam"
    },
    {
      "name": "Ranveer Singh"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/e17yr4y9eb1rh.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.21388",
  "fulltext_url": null,
  "id": "e17yr4y9eb1rh",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.21388",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "openalex",
      "2608|Graph theory and applications"
    ]
  ],
  "openalex": "W7222611900",
  "pdf_url": "https://arxiv.org/pdf/2610.21388",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-15",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/e17yr4y9eb1rh.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:29:54Z",
      "native_id": "2610.21388",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.21388"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Stronger Spectral Bound for Clique Number",
  "title_text": "Stronger Spectral Bound for Clique Number",
  "type": "preprint",
  "updated_at": "2026-10-30T12:29:54Z",
  "url": "https://research.draconitic.com/paper/e17yr4y9eb1rh",
  "venue": "arXiv",
  "versions": []
}