Hypergraphs with uniform Turán density equal to 8/27
In the 1980s, Erdős and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph \(H\) is the infimum over all \(d\) for which any sufficiently large hypergraph with the property that all its linear-size subhypergra...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2024-07 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Garbe, Frederik Iľkovič, Daniel Kráľ, Daniel Kučerák, Filip Ander Lamaison |
description | In the 1980s, Erdős and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph \(H\) is the infimum over all \(d\) for which any sufficiently large hypergraph with the property that all its linear-size subhypergraphs have density at least \(d\) contains \(H\). In particular, they asked to determine the uniform Turán densities of \(K_4^{(3)-}\) and \(K_4^{(3)}\). After more than 30 years, the former was solved in [Israel J. Math. 211 (2016), 349-366] and [J. Eur. Math. Soc. 20 (2018), 1139-1159], while the latter still remains open. Till today, there are known constructions of 3-uniform hypergraphs with uniform Turán density equal to 0, 1/27, 4/27 and 1/4 only. We extend this list by a fifth value: we prove an easy to verify condition for the uniform Turán density to be equal to 8/27 and identify hypergraphs satisfying this condition. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_3077525192</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3077525192</sourcerecordid><originalsourceid>FETCH-proquest_journals_30775251923</originalsourceid><addsrcrecordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQw9agsSC1KL0osyChWKM8syVAozctMyy_KVQgpLTq8ME8hJTWvOLOkUiG1sDQxR6EkX8FC38ich4E1LTGnOJUXSnMzKLu5hjh76BYU5ReWphaXxGfllxblAaXijQ3MzU2NTA0tjYyJUwUAuBE1DQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3077525192</pqid></control><display><type>article</type><title>Hypergraphs with uniform Turán density equal to 8/27</title><source>Free E- Journals</source><creator>Garbe, Frederik ; Iľkovič, Daniel ; Kráľ, Daniel ; Kučerák, Filip ; Ander Lamaison</creator><creatorcontrib>Garbe, Frederik ; Iľkovič, Daniel ; Kráľ, Daniel ; Kučerák, Filip ; Ander Lamaison</creatorcontrib><description>In the 1980s, Erdős and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph \(H\) is the infimum over all \(d\) for which any sufficiently large hypergraph with the property that all its linear-size subhypergraphs have density at least \(d\) contains \(H\). In particular, they asked to determine the uniform Turán densities of \(K_4^{(3)-}\) and \(K_4^{(3)}\). After more than 30 years, the former was solved in [Israel J. Math. 211 (2016), 349-366] and [J. Eur. Math. Soc. 20 (2018), 1139-1159], while the latter still remains open. Till today, there are known constructions of 3-uniform hypergraphs with uniform Turán density equal to 0, 1/27, 4/27 and 1/4 only. We extend this list by a fifth value: we prove an easy to verify condition for the uniform Turán density to be equal to 8/27 and identify hypergraphs satisfying this condition.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Density ; Graph theory ; Graphs ; Infimum</subject><ispartof>arXiv.org, 2024-07</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>778,782</link.rule.ids></links><search><creatorcontrib>Garbe, Frederik</creatorcontrib><creatorcontrib>Iľkovič, Daniel</creatorcontrib><creatorcontrib>Kráľ, Daniel</creatorcontrib><creatorcontrib>Kučerák, Filip</creatorcontrib><creatorcontrib>Ander Lamaison</creatorcontrib><title>Hypergraphs with uniform Turán density equal to 8/27</title><title>arXiv.org</title><description>In the 1980s, Erdős and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph \(H\) is the infimum over all \(d\) for which any sufficiently large hypergraph with the property that all its linear-size subhypergraphs have density at least \(d\) contains \(H\). In particular, they asked to determine the uniform Turán densities of \(K_4^{(3)-}\) and \(K_4^{(3)}\). After more than 30 years, the former was solved in [Israel J. Math. 211 (2016), 349-366] and [J. Eur. Math. Soc. 20 (2018), 1139-1159], while the latter still remains open. Till today, there are known constructions of 3-uniform hypergraphs with uniform Turán density equal to 0, 1/27, 4/27 and 1/4 only. We extend this list by a fifth value: we prove an easy to verify condition for the uniform Turán density to be equal to 8/27 and identify hypergraphs satisfying this condition.</description><subject>Density</subject><subject>Graph theory</subject><subject>Graphs</subject><subject>Infimum</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNpjYuA0MjY21LUwMTLiYOAtLs4yMDAwMjM3MjU15mQw9agsSC1KL0osyChWKM8syVAozctMyy_KVQgpLTq8ME8hJTWvOLOkUiG1sDQxR6EkX8FC38ich4E1LTGnOJUXSnMzKLu5hjh76BYU5ReWphaXxGfllxblAaXijQ3MzU2NTA0tjYyJUwUAuBE1DQ</recordid><startdate>20240708</startdate><enddate>20240708</enddate><creator>Garbe, Frederik</creator><creator>Iľkovič, Daniel</creator><creator>Kráľ, Daniel</creator><creator>Kučerák, Filip</creator><creator>Ander Lamaison</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20240708</creationdate><title>Hypergraphs with uniform Turán density equal to 8/27</title><author>Garbe, Frederik ; Iľkovič, Daniel ; Kráľ, Daniel ; Kučerák, Filip ; Ander Lamaison</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_30775251923</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Density</topic><topic>Graph theory</topic><topic>Graphs</topic><topic>Infimum</topic><toplevel>online_resources</toplevel><creatorcontrib>Garbe, Frederik</creatorcontrib><creatorcontrib>Iľkovič, Daniel</creatorcontrib><creatorcontrib>Kráľ, Daniel</creatorcontrib><creatorcontrib>Kučerák, Filip</creatorcontrib><creatorcontrib>Ander Lamaison</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Garbe, Frederik</au><au>Iľkovič, Daniel</au><au>Kráľ, Daniel</au><au>Kučerák, Filip</au><au>Ander Lamaison</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Hypergraphs with uniform Turán density equal to 8/27</atitle><jtitle>arXiv.org</jtitle><date>2024-07-08</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>In the 1980s, Erdős and Sós initiated the study of Turán problems with a uniformity condition on the distribution of edges: the uniform Turán density of a hypergraph \(H\) is the infimum over all \(d\) for which any sufficiently large hypergraph with the property that all its linear-size subhypergraphs have density at least \(d\) contains \(H\). In particular, they asked to determine the uniform Turán densities of \(K_4^{(3)-}\) and \(K_4^{(3)}\). After more than 30 years, the former was solved in [Israel J. Math. 211 (2016), 349-366] and [J. Eur. Math. Soc. 20 (2018), 1139-1159], while the latter still remains open. Till today, there are known constructions of 3-uniform hypergraphs with uniform Turán density equal to 0, 1/27, 4/27 and 1/4 only. We extend this list by a fifth value: we prove an easy to verify condition for the uniform Turán density to be equal to 8/27 and identify hypergraphs satisfying this condition.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2024-07 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_3077525192 |
source | Free E- Journals |
subjects | Density Graph theory Graphs Infimum |
title | Hypergraphs with uniform Turán density equal to 8/27 |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T01%3A03%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Hypergraphs%20with%20uniform%20Tur%C3%A1n%20density%20equal%20to%208/27&rft.jtitle=arXiv.org&rft.au=Garbe,%20Frederik&rft.date=2024-07-08&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E3077525192%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3077525192&rft_id=info:pmid/&rfr_iscdi=true |