Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Counting Small Induced Subgraphs: Hardness of Symmetry-Based Properties
Radu Curticapean, Mingjun Liu
Jerrum and Meeks (TOCT, JCSS 2015) introduced the counting problems for fixed graph properties : Given an input graph and , count the -v…
cs.CC2021
On Algorithms Based on Finitely Many Homomorphism Counts
Yijia Chen, Jörg Flum, Mingjun Liu +1
It is well known [Lovász, 67] that up to isomorphism a graph~ is determined by the homomorphism counts , i.e., the number of homomorphisms from to , where …