On the structure of random hypergraphs
-
Published:2018
Issue:118
Volume:104
Page:43-51
-
ISSN:0350-1302
-
Container-title:Publications de l'Institut Math?matique (Belgrade)
-
language:en
-
Short-container-title:Publ Inst Math (Belgr)
Abstract
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.
Funder
Ministry of Education, Science and Technological Development of the Republic of Serbia
Publisher
National Library of Serbia
Subject
General Mathematics