Hypergraphs with Minimum Positive Uniform Turán Density
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F21%3A00125999" target="_blank" >RIV/00216224:14330/21:00125999 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-030-83823-2_24" target="_blank" >http://dx.doi.org/10.1007/978-3-030-83823-2_24</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-83823-2_24" target="_blank" >10.1007/978-3-030-83823-2_24</a>
Alternative languages
Result language
angličtina
Original language name
Hypergraphs with Minimum Positive Uniform Turán Density
Original language description
Reiher, Rödl and Schacht [J. London Math. Soc. 97 (2018), 77–97] showed that the uniform Turán density of every 3-uniform hypergraph is either 0 or at least 1/27, and asked whether there exist 3-uniform hypergraphs with uniform Turán density equal or arbitrarily close to 1/27. We construct 3-uniform hypergraphs with uniform Turán density equal to 1/27.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Trends in Mathematics, Volume 14, Extended Abstracts of EuroComb 2021, European Conference on Combinatorics, Graph Theory and Applications
ISBN
9783030838225
ISSN
2297-0215
e-ISSN
—
Number of pages
6
Pages from-to
148-153
Publisher name
Birkhäuser
Place of publication
Barcelona
Event location
Barcelona
Event date
Jan 1, 2021
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—