##
###
Counting Small Induced Subgraphs Satisfying Monotone Properties

Marc Roth, Johannes Schmitt, Philip Wellnitz

2020
*
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
*

Sci. 15] and is part of the major line of research on *counting* *small* patterns in graphs. ...
Given a graph *property* Φ, the problem #IndSub(Φ) asks, on input a graph G and a positive integer k, to compute the number #IndSub(Φ, k → G) of *induced* *subgraphs* of size k in G that satisfy Φ. ...
Given any graph H, the *property* Φ of being H-free, that is, not containing H as an *induced* *subgraph*, is *hereditary* *with* Γ(Φ) = {H}. ...

doi:10.1109/focs46700.2020.00128
fatcat:5c4e6tpanrhjle537ksibs4m6q