The ODD EVEN DELTA problem is #P-hard
Abstract
Let G=(V,E) be a graph. Let k < |V| be an integer. Let Ok be the number of edge induced subgraphs of G having k vertices and an odd number of edges. Let Ek be the number of edge induced subgraphs of G having k vertices and an even number of edges. Let Dk = Ok - Ek. The ODD EVEN DELTA problem consists in computing Dk, given G and k. We show that such problem is #P-hard, even on 3-regular bipartite planar graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.