Open AccessOn the structure of random hypergraphs
Author(s) -
Boriša Kuzeljević
Publication year - 2018
Publication title -
publications de l'institut mathématique
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.246
H-Index - 17
eISSN - 1820-7405
pISSN - 0350-1302
DOI - 10.2298/pim1818043k
Subject(s) - mathematics , countable set , combinatorics , order (exchange) , embedding , order type , chain (unit) , type (biology) , discrete mathematics , hypergraph , element (criminal law) , set (abstract data type) , computer science , physics , ecology , finance , astronomy , artificial intelligence , political science , law , economics , biology , programming language
Let Hn be a countable random n-uniform hypergraph for n > 2, and P(Hn) = {f[Hn] : f : Hn ? Hn is an embedding}. We prove that a linear order L is isomorphic to the maximal chain in the partial order ?P(Hn)?{?},?? if and only if L is isomorphic to the order type of a compact set of reals whose minimal element is nonisolated.