Intersections of random hypergraphs and tournaments

Given two random hypergraphs, or two random tournaments of order n, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.

Bibliographic Details
Main Authors: Bollobas, B, Scott, A
Format: Journal article
Published: Elsevier 2014
_version_ 1797084557122469888
author Bollobas, B
Scott, A
author_facet Bollobas, B
Scott, A
author_sort Bollobas, B
collection OXFORD
description Given two random hypergraphs, or two random tournaments of order n, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.
first_indexed 2024-03-07T01:56:48Z
format Journal article
id oxford-uuid:9bf8cb54-f590-4680-bca1-4f0025a708f1
institution University of Oxford
last_indexed 2024-03-07T01:56:48Z
publishDate 2014
publisher Elsevier
record_format dspace
spelling oxford-uuid:9bf8cb54-f590-4680-bca1-4f0025a708f12022-03-27T00:32:54ZIntersections of random hypergraphs and tournamentsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:9bf8cb54-f590-4680-bca1-4f0025a708f1Symplectic Elements at OxfordElsevier2014Bollobas, BScott, AGiven two random hypergraphs, or two random tournaments of order n, how much (or little) can we make them overlap by placing them on the same vertex set? We give asymptotic answers to this question.
spellingShingle Bollobas, B
Scott, A
Intersections of random hypergraphs and tournaments
title Intersections of random hypergraphs and tournaments
title_full Intersections of random hypergraphs and tournaments
title_fullStr Intersections of random hypergraphs and tournaments
title_full_unstemmed Intersections of random hypergraphs and tournaments
title_short Intersections of random hypergraphs and tournaments
title_sort intersections of random hypergraphs and tournaments
work_keys_str_mv AT bollobasb intersectionsofrandomhypergraphsandtournaments
AT scotta intersectionsofrandomhypergraphsandtournaments