{"title":"关于随机超图的结构","authors":"Boriša Kuzeljević","doi":"10.2298/PIM1818043K","DOIUrl":null,"url":null,"abstract":". Let H n be a countable random n -uniform hypergraph for n > 2, and P ( H n ) = { f [ H n ] : f : H n → H n is an embedding } . We prove that a linear order L is isomorphic to the maximal chain in the partial order h P ( H n ) ∪{∅} , ⊂i if and only if L is isomorphic to the order type of a compact set of reals whose minimal element is nonisolated.","PeriodicalId":416273,"journal":{"name":"Publications De L'institut Mathematique","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the structure of random hypergraphs\",\"authors\":\"Boriša Kuzeljević\",\"doi\":\"10.2298/PIM1818043K\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". Let H n be a countable random n -uniform hypergraph for n > 2, and P ( H n ) = { f [ H n ] : f : H n → H n is an embedding } . We prove that a linear order L is isomorphic to the maximal chain in the partial order h P ( H n ) ∪{∅} , ⊂i if and only if L is isomorphic to the order type of a compact set of reals whose minimal element is nonisolated.\",\"PeriodicalId\":416273,\"journal\":{\"name\":\"Publications De L'institut Mathematique\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Publications De L'institut Mathematique\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2298/PIM1818043K\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Publications De L'institut Mathematique","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/PIM1818043K","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
。让H n be a countable随机n -uniform hypergraph for n > 2, H和P (n) = {f H [n]: f: H H n→n是一个嵌入的。我们证明那a订单L是线性同构最高链》《部分商品订单h h P (n)∪{∅},⊂我如果只和如果洛杉矶是同构的订单类型》的cd套reals至少一个元素是nonisolated。
. Let H n be a countable random n -uniform hypergraph for n > 2, and P ( H n ) = { f [ H n ] : f : H n → H n is an embedding } . We prove that a linear order L is isomorphic to the maximal chain in the partial order h P ( H n ) ∪{∅} , ⊂i if and only if L is isomorphic to the order type of a compact set of reals whose minimal element is nonisolated.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
