GARBE, Frederik, Daniel KRÁĽ and Ander LAMAISON VIDARTE. Hypergraphs with Minimum Positive Uniform Turán Density. In Trends in Mathematics, Volume 14, Extended Abstracts of EuroComb 2021, European Conference on Combinatorics, Graph Theory and Applications. Barcelona: Birkhäuser, 2021, p. 148-153. ISBN 978-3-030-83822-5. Available from: https://dx.doi.org/10.1007/978-3-030-83823-2_24.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Hypergraphs with Minimum Positive Uniform Turán Density
Authors GARBE, Frederik (276 Germany, belonging to the institution), Daniel KRÁĽ (203 Czech Republic, belonging to the institution) and Ander LAMAISON VIDARTE (724 Spain, belonging to the institution).
Edition Barcelona, Trends in Mathematics, Volume 14, Extended Abstracts of EuroComb 2021, European Conference on Combinatorics, Graph Theory and Applications, p. 148-153, 6 pp. 2021.
Publisher Birkhäuser
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
RIV identification code RIV/00216224:14330/21:00125999
Organization unit Faculty of Informatics
ISBN 978-3-030-83822-5
ISSN 2297-0215
Doi http://dx.doi.org/10.1007/978-3-030-83823-2_24
Keywords in English extremal combinatorics; Turán density; uniform Turán density
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 28/3/2023 11:22.
Abstract
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.
PrintDisplayed: 10/10/2024 18:33