arXiv (OAI Expanded)
open access
A Proof of the Tratnik-Ye Medianity Conjecture of Resonance Graphs on Surfaces
We prove the Tratnik--Ye conjecture that every connected component of a resonance graph of perfect matchings on a closed surface is median whenever the allowed even faces form a proper subset of all faces. The embedding need not be cellular or strong, and the graph need not be bipartite. We also sho
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
- Unfair Sampling of Quantum Annealing in Weighted Graph Bipartitioning Problems#668494
- A disproof of a gap-one conjecture for the equitable chromatic number of block graphs#609675
- A deterministic $(2 + \varepsilon)$-approximation for directed feedback vertex sets in tournaments#1122732
- Two Problems on Bipartite Graphs#492232
- Maximum Matching-Match: Hardness and Approximation#975248
Record · ID 1070497
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