Recognition: unknown
Intersections of hypergraphs
classification
🧮 math.CO
keywords
themhypergraphsconcentrateddistributiongivenintersectionintersectionsinvestigate
read the original abstract
Given two weighted k-uniform hypergraphs G, H of order n, how much (or little) can we make them overlap by placing them on the same vertex set? If we place them at random, how concentrated is the distribution of the intersection? The aim of this paper is to investigate these questions.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.