Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes

@article{Curticapean2018CountingEH,
  title={Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes},
  author={Radu Curticapean and Holger Dell and Marc Roth},
  journal={Theory of Computing Systems},
  year={2018},
  volume={63},
  pages={987-1026}
}
We consider the #W[1]-hard problem of counting all matchings with exactly k edges in a given input graph G; we prove that it remains #W[1]-hard on graphs G that are line graphs or bipartite graphs with degree 2 on one side. In our proofs, we use that k-matchings in line graphs can be equivalently viewed as edge-injective homomorphisms from the disjoint union of k length-2 paths into (arbitrary) host graphs. Here, a homomorphism from H to G is edge-injective if it maps any two distinct edges of… 

Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices

TLDR
The main ingredients of the proof are the complexity classification of linear combinations of homomorphisms due to Curticapean, Dell and Marx as well as a corollary of Rota's NBC Theorem which states that the sign of the M\"obius function over a geometric lattice only depends on the rank of its arguments.

Counting Subgraphs in Somewhere Dense Graphs

We study the problems of counting copies and induced copies of a small pattern graph H in a large host graph G . Recent work fully classified the complexity of those problems according to structural

Counting Problems on Quantum Graphs: Parameterized and Exact Complexity Classifications

TLDR
Novel combinatorial, algebraic and even topological properties of quantum graphs are established that allow them to provide exhaustive parameterized and exact complexity classifications, including necessary, sufficient and mostly explicit tractability criteria, for all of the previous problems.

Compactors for parameterized counting problems

Counting Problems in Parameterized Complexity

TLDR
The parameterized approach to counting problems is surveyed, with a focus on two topics of recent interest: Counting small patterns in large graphs, and counting perfect matchings and Hamiltonian cycles in well-structured graphs.

Incremental FPT Delay

TLDR
This paper introduces two hierarchies of enumeration complexity classes for incremental fpt-time in terms of exponent slices and shows how they interleave, and defines several parameterized function classes and introduces the parameterized counterpart of the class of nondeterministic multivalued functions with values that are polynomially verifiable and guaranteed to exist, TFNP.

References

SHOWING 1-10 OF 69 REFERENCES

Homomorphisms are a good basis for counting small subgraphs

TLDR
Graph motif parameters are introduced, a class of graph parameters that depend only on the frequencies of constant-size induced subgraphs, and a general complexity dichotomy for evaluating graph motif parameters is proved, which allows us to recover known dichotomies for counting sub graphs, induced sub Graph, and homomorphisms in a uniform and simplified way.

Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts

TLDR
An independent and somewhat simpler proof of the classical result of Flum and Grohe stating that counting paths of length k is #W[1]-hard is obtained, as well as a similar almost-tight ETH-based lower bound on the exponent.

Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices

TLDR
The main ingredients of the proof are the complexity classification of linear combinations of homomorphisms due to Curticapean, Dell and Marx as well as a corollary of Rota's NBC Theorem which states that the sign of the M\"obius function over a geometric lattice only depends on the rank of its arguments.

The Complexity of Counting in Sparse, Regular, and Planar Graphs

TLDR
It is proved that the problems of counting matchings, vertex covers, independent sets, and extremal variants of these all remain hard when restricted to planar bipartite graphs of bounded degree or regular graphs of constant degree.

Counting Matchings of Size k Is W[1]-Hard

We prove $\sharp$W[1]-hardness of the following parameterized counting problem: Given a simple undirected graph G and a parameter k∈ℕ, compute the number of matchings of size k in G. It is known

The Parameterized Complexity of k-Biclique

TLDR
It is shown that for t = (s +1)! and n large enough, such threshold bipartite graphs can be computed in polynomial time and implies a dichotomy classification of the parameterized complexity of cardinality constraint satisfaction problems and the inapproximability of the maximum k-intersection problem.

Generalized Model-Checking over Locally Tree-Decomposable Classes

  • M. Frick
  • Mathematics, Computer Science
    Theory of Computing Systems
  • 2003
TLDR
More general computational problems than decision problems, which are induced by formulas with free variables are considered, and it is shown that each problems can be solved in linear time on locally tree-decomposable classes of structures.

The strong perfect graph theorem

In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect graph is a graph in which the chromatic number of every induced
...