arXiv (All)
open access
Odd Cycle Transversal on $H$-free graphs
\textsc{Odd Cycle Transversal} is a classic $\mathsf{NP}$-hard graph optimization problem asking for a minimum-weight set of vertices whose deletion makes the input graph bipartite, or equivalently, a maximum-weight induced bipartite subgraph. We show that \textsc{Odd Cycle Transversal} is quasi-pol
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
- AutoGraphForge: Towards Automated Graph Theory Discovery#926397
- Hamiltonian graphs with prescribed minimum degree and no near-spanning cycles#972532
- Unavoidable induced subgraphs forced by graphs with many vertices of prescribed properties#1122975
- Nucleation mechanism for the direct graphite-to-diamond phase transition#1128447
- A minimum witness for the 3/2 configuration-linear-program gap in two-weight graph balancing, unique at its size#999284
Record · ID 1105459
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