Estimating global subgraph counts by sampling
We give a simple proof of a generalization of an inequality for homomorphism counts by Sidorenko. A special case of our inequality says that if dv denotes the degree of a vertex v in a graph G and hom∆(H, G) denotes the number of homo-morphisms from a connected graph H on h vertices to G which map a...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Australian National University
2023
|
| Online Access: | View Fulltext in Publisher View in Scopus |