On $ \mathsf{{H}} $-intersecting graph families and counting of homomorphisms
This work derives an upper bound on the maximum cardinality of a family of graphs on a fixed number of vertices, in which the intersection of every two graphs in that family contains a subgraph that is isomorphic to a specified graph $ \mathsf{{H}} $. Such families are referred to as $ \mathsf{{H}}...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AIMS Press
2025-03-01
|
| Series: | AIMS Mathematics |
| Subjects: | |
| Online Access: | https://www.aimspress.com/article/doi/10.3934/math.2025290 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|