[{"_1":2,"_3":-5,"_4":-5},"loaderData",{"_5":6,"_7":8,"_9":10},"actionData","errors","root",{"_248":249},"routes/_layout",{"_11":168},"routes/entity.$type.$id",{"_11":12,"_13":14,"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"dehydratedState",{"_74":75,"_76":77},"type","paper","id","paper_W2034838716","section","articles","entity",{"_15":16,"_29":30,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":38,"_39":-5,"_40":41,"_42":43,"_44":45,"_46":47,"_48":-5,"_49":50,"_51":30,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":-5,"_63":64,"_65":66,"_67":68,"_69":30,"_70":-5},"canonical","https://www.hugmap.com/entity/paper/paper_W2034838716/articles","siteBaseUrl","https://www.hugmap.com","sectionCount",0,"jsonLd","{\"@context\":\"https://schema.org\",\"@graph\":[{\"name\":\"Independent sets in hypergraphs\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2034838716/articles\",\"@type\":\"ScholarlyArticle\",\"headline\":\"Independent sets in hypergraphs\",\"datePublished\":\"2014-08-07\",\"isPartOf\":{\"@type\":\"Periodical\",\"name\":\"Journal of the American Mathematical Society\"}},{\"@type\":\"CollectionPage\",\"name\":\"Independent sets in hypergraphs 相关文章\",\"description\":\"Independent sets in hypergraphs 在 HugMap 中的相关文章，含结构化关联信息与详情链接。\",\"url\":\"https://www.hugmap.com/entity/paper/paper_W2034838716/articles\",\"inLanguage\":\"zh-CN\"},{\"@type\":\"BreadcrumbList\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"首页\",\"item\":\"https://www.hugmap.com/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"论文\",\"item\":\"https://www.hugmap.com/search?type=paper\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Independent sets in hypergraphs\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2034838716\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"相关文章\",\"item\":\"https://www.hugmap.com/entity/paper/paper_W2034838716/articles\"}]}]}","name","Independent sets in hypergraphs","nameZh","aliases","description","descriptionZh","status","active","externalIds","{\"openalex\":\"W2034838716\",\"doi\":\"10.1090/s0894-0347-2014-00816-x\"}","properties","source","openalex","createdAt","2026-05-20T09:08:29.202370507","updatedAt","2026-05-20T09:08:29.203834782","doi","10.1090/s0894-0347-2014-00816-x","arxivId","openalexId","W2034838716","title","abstractText","Many important theorems and conjectures in combinatorics, such as the theorem of Szemerédi on arithmetic progressions and the Erdős–Stone Theorem in extremal graph theory, can be phrased as statements about families of independent sets in certain uniform hypergraphs. In recent years, an important trend in the area has been to extend such classical results to the so-called ‘sparse random setting’. This line of research has recently culminated in the breakthroughs of Conlon and Gowers and of Schacht, who developed general tools for solving problems of this type. Although these two articles solved very similar sets of longstanding open problems, the methods used are very different from one another and have different strengths and weaknesses. In this article, we provide a third, completely different, approach to proving extremal and structural results in sparse random sets that also yields their natural ‘counting’ counterparts. We give a structural characterization of the independent sets in a large class of uniform hypergraphs by showing that every independent set is almost contained in one of a small number of relatively sparse sets. We then derive many interesting results as fairly straightforward consequences of this abstract theorem. In particular, we prove the well-known conjecture of Kohayakawa, Łuczak, and Rödl, a probabilistic embedding lemma for sparse graphs. We also give alternative proofs of many of the results of Conlon and Gowers and of Schacht, such as sparse random versions of Szemerédi’s theorem, the Erdős–Stone Theorem, and the Erdős–Simonovits Stability Theorem, and obtain their natural ‘counting’ versions, which in some cases are considerably stronger. For example, we show that for each positive β \\beta and integer k k , there are at most ( β n m ) \\binom {\\beta n}{m} sets of size m m that contain no k k -term arithmetic progression, provided that m ⩾ C n 1 − 1 / ( k − 1 ) m \\geqslant Cn^{1-1/(k-1)} , where C C is a constant depending only on β \\beta and k k . We also obtain new results, such as a sparse version of the Erdős–Frankl–Rödl Theorem on the number of H H -free graphs and, as a consequence of the KŁR conjecture, we extend a result of Rödl and Ruciński on Ramsey properties in sparse random graphs to the general, non-symmetric setting.","publishedDate","2014-08-07","publishedYear",2014,"venue","Journal of the American Mathematical Society","citationCount",340,"authors","keywords",[71,72,73],"pdfUrl","https://www.ams.org/jams/2015-28-03/S0894-0347-2014-00816-X/S0894-0347-2014-00816-X.pdf","topVenue",false,"displayName","displayDescription","Limits and Structures in Graph Theory","Advanced Graph Theory Research","Graph theory and applications","mutations",[],"queries",[78],{"_79":80,"_81":82,"_83":84,"_85":86},"dehydratedAt",1780751243151,"state",{"_88":89,"_90":91,"_92":80,"_93":-5,"_94":26,"_95":26,"_96":26,"_97":-5,"_98":-5,"_99":68,"_35":100,"_101":102},"queryKey",[87,19,14,16],"queryHash","[\"portal\",\"entity\",\"paper\",\"paper_W2034838716\"]","portal","data",{"_19":20,"_103":104,"_105":106,"_107":108,"_18":109,"_110":111,"_62":112},"dataUpdateCount",1,"dataUpdatedAt","error","errorUpdateCount","errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","success","fetchStatus","idle","entityType","Paper","taxonomies",[135,136,137],"events",[],[],"technologies",[],[113,114],{"_15":129,"_29":130,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":131,"_39":-5,"_40":41,"_42":132,"_44":133,"_120":134,"_51":-5,"_121":-5,"_122":-5,"_123":-5,"_60":-5,"_124":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_69":130,"_70":-5},{"_15":115,"_29":116,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":117,"_39":-5,"_40":41,"_42":118,"_44":119,"_120":-5,"_51":-5,"_121":-5,"_122":-5,"_123":-5,"_60":-5,"_124":-5,"_125":-5,"_126":-5,"_127":-5,"_128":-5,"_69":116,"_70":-5},"person_A5108264183","József Balogh","{\"openalex\":\"A5108264183\"}","2026-05-20T09:08:30.177805584","2026-05-20T09:08:30.177637391","orcid","affiliation","researchArea","paperCount","homepage","linkedin","twitter","github","hindex","person_A5026232768","Wojciech Samotij","{\"openalex\":\"A5026232768\",\"orcid\":\"0000-0002-0484-4169\"}","2026-05-20T09:08:32.176141838","2026-05-20T09:08:32.177738968","0000-0002-0484-4169",{"_15":162,"_29":72,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":163,"_39":-5,"_40":41,"_42":164,"_44":165,"_142":143,"_144":-5,"_145":146,"_147":166,"_149":167,"_151":26,"_152":153,"_154":26,"_155":-5,"_69":72,"_70":-5},{"_15":156,"_29":73,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":157,"_39":-5,"_40":41,"_42":158,"_44":159,"_142":143,"_144":-5,"_145":146,"_147":160,"_149":161,"_151":26,"_152":153,"_154":26,"_155":-5,"_69":73,"_70":-5},{"_15":138,"_29":71,"_31":-5,"_32":-5,"_33":-5,"_34":-5,"_35":36,"_37":139,"_39":-5,"_40":41,"_42":140,"_44":141,"_142":143,"_144":-5,"_145":146,"_147":148,"_149":150,"_151":26,"_152":153,"_154":26,"_155":-5,"_69":71,"_70":-5},"tax_rd_T11329","{\"openalex_topic\":\"T11329\"}","2026-05-14T01:15:41.362518177","2026-05-23T11:35:36.285013189","taxonomyType","RESEARCH_DOMAIN","code","level",3,"parentId","tax_rd_2607","path","Physical Sciences/Mathematics/Discrete Mathematics and Combinatorics/Limits and Structures in Graph Theory","sortOrder","isLeaf",true,"entityCount","children","tax_rd_T11476","{\"openalex_topic\":\"T11476\"}","2026-05-14T00:50:29.316961415","2026-05-23T10:31:33.214595894","tax_rd_2608","Physical Sciences/Mathematics/Geometry and Topology/Graph theory and applications","tax_rd_T10374","{\"openalex_topic\":\"T10374\"}","2026-05-14T00:42:06.292994479","2026-05-23T12:24:03.275859385","tax_rd_1703","Physical Sciences/Computer Science/Computational Theory and Mathematics/Advanced Graph Theory Research",{"_74":169,"_76":170},[],[171],{"_79":172,"_81":173,"_83":174,"_85":175},1780751242024,{"_88":177,"_90":91,"_92":172,"_93":-5,"_94":26,"_95":26,"_96":26,"_97":-5,"_98":-5,"_99":68,"_35":100,"_101":102},[87,176],"[\"portal\",\"industries\"]","industries",[178,179,180,181,182,183,184,185,186,187,188,189],{"_15":241,"_29":242,"_31":-5,"_32":243,"_33":244,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":245,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":242,"_70":244},{"_15":237,"_29":238,"_31":-5,"_32":-5,"_33":239,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":240,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":238,"_70":239},{"_15":231,"_29":232,"_31":-5,"_32":233,"_33":234,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":235,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":232,"_70":234},{"_15":227,"_29":228,"_31":-5,"_32":-5,"_33":229,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":230,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":228,"_70":229},{"_15":223,"_29":224,"_31":-5,"_32":-5,"_33":225,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":226,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":224,"_70":225},{"_15":217,"_29":218,"_31":-5,"_32":219,"_33":220,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":221,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":218,"_70":220},{"_15":213,"_29":214,"_31":-5,"_32":-5,"_33":215,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":216,"_151":26,"_152":153,"_154":26,"_155":-5,"_69":214,"_70":215},{"_15":209,"_29":210,"_31":-5,"_32":-5,"_33":211,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":212,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":210,"_70":211},{"_15":205,"_29":206,"_31":-5,"_32":-5,"_33":207,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":208,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":206,"_70":207},{"_15":201,"_29":202,"_31":-5,"_32":-5,"_33":203,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":204,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":202,"_70":203},{"_15":197,"_29":198,"_31":-5,"_32":-5,"_33":199,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":200,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":198,"_70":199},{"_15":190,"_29":191,"_31":-5,"_32":-5,"_33":192,"_34":-5,"_35":36,"_37":-5,"_39":-5,"_40":193,"_42":-5,"_44":-5,"_142":194,"_144":-5,"_145":91,"_147":195,"_149":196,"_151":26,"_152":68,"_154":26,"_155":-5,"_69":191,"_70":192},"tax_ind_smartphone","智能手机","Smartphone","manual","INDUSTRY","tax_ind_root","科技行业/智能手机","tax_ind_robot","机器人","Robotics","科技行业/机器人","tax_ind_wearable","智能穿戴","Smart Wearables","科技行业/智能穿戴","tax_ind_energy","新能源与智能制造","New Energy & Smart Manufacturing","科技行业/新能源与智能制造","tax_ind_biotech","生物科技","Biotech","科技行业/生物科技","tax_ind_quantum","量子计算","Quantum Computing","科技行业/量子计算","tax_ind_blockchain","区块链",[222],"Blockchain","科技行业/区块链","Web3","tax_ind_enterprise","企业软件","Enterprise Software","科技行业/企业软件","tax_ind_security","网络安全","Cybersecurity","科技行业/网络安全","tax_ind_semi","半导体",[236],"Semiconductor","科技行业/半导体","芯片","tax_ind_cloud","云计算","Cloud Computing","科技行业/云计算","tax_ind_ai","人工智能",[246,247],"Artificial Intelligence","科技行业/人工智能","AI","AI 技术","env",{"_250":24},"SITE_BASE_URL"]

Independent sets in hypergraphs 论文

Independent sets in hypergraphs · 相关文章