arXiv (All)
open access
Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
The inertia bound, introduced by Cvetković in 1971, is a fundamental result in spectral graph theory that provides an upper bound for the independence number of a graph in terms of spectral information about a weighted adjacency matrix of the graph. Recently, this bound has been extended to the so-c
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
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#924635
- Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs#920403
- A Note on the Invertibility of Oriented Graphs#628825
- Finite graphs and configurations of points#984065
- On the Visibility Polynomial of Graphs#128428
Record · ID 1118536
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