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.
Príomhchruthaitheoirí: | Bollobas, B, Scott, A |
---|---|
Formáid: | Journal article |
Foilsithe / Cruthaithe: |
Elsevier
2014
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Intersections of random hypergraphs and tournaments
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2014) -
Packing random graphs and hypergraphs
de réir: Bollobas, B, et al.
Foilsithe / Cruthaithe: (2016) -
Exploring hypergraphs with martingales
de réir: Bollobás, B, et al.
Foilsithe / Cruthaithe: (2017) -
Edge intersection hypergraphs
de réir: Martin Sonntag, et al.
Foilsithe / Cruthaithe: (2024-01-01) -
A note on intersecting hypergraphs with large cover number
de réir: Haxell, P, et al.
Foilsithe / Cruthaithe: (2017)