NYU Faculty Digital Archive
metadata only
ALMOST PERFECT MATRICES AND GRAPHS
We introduce the notions of w-projection and k-projection that map almost integral polytopes associated with almost perfect graphs G with n nodes from Rn into Rn-w where w is the maximum clique size in G. We show that C. Berge's strong perfect graph conjecture is correct if and only if the projec
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
- Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor#998825
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- Order and Gorenstein properties for lattice path matroid polytopes#820127
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#799562
- An Improved Bound for Smith's Longest Cycles Conjecture via a Forbidden Subdivision#798139
Record · ID 941673
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