arXiv (All)
open access
Hidden Circuits and Exact Counting in Ordered Graphs
We prove that counting perfect matchings is $\#P$-complete under polynomial-time Turing reductions on each of three classes of simple, unweighted graphs: monotone graphs, unit interval graphs, and chordal permutation graphs. The monotone result settles the exact-counting complexity left open by Dyer
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
- Towards Solving the Gilbert-Pollak Conjecture via Large Language Models#924496
- Towards Solving the Gilbert-Pollak Conjecture via Large Language Models#920265
- On-line vertex ranking of trees#798503
- On-line vertex ranking of trees#797090
- Constructions for positional games and applications to domination games / Ali Deniz Bagdas, Dennis Clemens, Fabian Hamann, Yannick Mogge#921993
Record · ID 1011828
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