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.
Glavni autori: | Bollobas, B, Scott, A |
---|---|
Format: | Journal article |
Izdano: |
Elsevier
2014
|
Slični predmeti
-
Intersections of random hypergraphs and tournaments
od: Bollobas, B, i dr.
Izdano: (2014) -
Packing random graphs and hypergraphs
od: Bollobas, B, i dr.
Izdano: (2016) -
Exploring hypergraphs with martingales
od: Bollobás, B, i dr.
Izdano: (2017) -
Edge intersection hypergraphs
od: Martin Sonntag, i dr.
Izdano: (2024-01-01) -
A note on intersecting hypergraphs with large cover number
od: Haxell, P, i dr.
Izdano: (2017)