arXiv (All)
open access
The Local Dyadic Conjecture
A rational with denominator a power of two is said to be dyadic. A long standing conjecture of Paul Seymour predicts that for an ideal clutter, the dual of the set covering problem always admits an optimal solution where all variables take dyadic values. We present a local version of this conjecture
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
- Probabilities of Conditionals and Conditional Probabilities — Revisited#85422
- Ramsey-like theorems for the Schreier barrier#179100
- Near-bipartite bricks in which every b-invariant edge is a forcing edge#1070862
- Double-Partition Coloring problem: a unified approach for conflict-free coloring of hypergraphs and other coloring problems in graphs#1233193
- Forcing monochromatic subdivisions#820059
Record · ID 1413802
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