arXiv (All)
open access
Full termination of MMP for klt pairs with big boundaries
We prove the full termination of the minimal model program for klt pairs with big boundaries.
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
- Compact Partial Symmetry Breaking for Graph Search Problems#1035952
- Odd and Even Harder Problems on Cycle-Factors#1104900
- Digraphs of Large Girth and Dichromatic Number in Tournaments with Large Dichromatic Number#1036284
- Making spanning graphs#1122858
- Near-optimal quantum query lower bounds on bipartiteness and expansion testing in the bounded-degree graph model#1157023
Record · ID 1118752
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