arXiv (All)
open access
On some k-fold generalizations of Lovász theta and their sandwich theorems
We study several $k$-fold generalizations of the Lovász theta function associated with the maximum $k$-colorable induced subgraph problem. The first is the Narasimhan--Manber parameter $\vartheta_k$. We prove that, for graphs whose adjacency matrix belongs to a homogeneous partially coherent algebra
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 properties of maximal (outer)planar graphs#972204
- Polynomial-time recognition and maximum independent set in Burling graphs#174041
- Polynomial-time recognition and maximum independent set in Burling graphs#173463
- Polynomial-time recognition and maximum independent set in Burling graphs#173213
- Polynomial-time recognition and maximum independent set in Burling graphs#172197
Record · ID 973895
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