Intersections of hypergraphs
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.
Main Authors: | Bollobas, B, Scott, A |
---|---|
Format: | Journal article |
Udgivet: |
Elsevier
2014
|
Lignende værker
-
Intersections of random hypergraphs and tournaments
af: Bollobas, B, et al.
Udgivet: (2014) -
Packing random graphs and hypergraphs
af: Bollobas, B, et al.
Udgivet: (2016) -
Exploring hypergraphs with martingales
af: Bollobás, B, et al.
Udgivet: (2017) -
Edge intersection hypergraphs
af: Martin Sonntag, et al.
Udgivet: (2024-01-01) -
A note on intersecting hypergraphs with large cover number
af: Haxell, P, et al.
Udgivet: (2017)