Kurz gefasst
Fachartikel in der Zeitschrift Advances in Combinatorics, 2022. Verfasst von David Conlan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref).
Abstract (Originalsprache)
A longstanding conjecture of Erd˝os and Simonovits states that for every rational r between 1 and 2 there is a graph H such that the largest number of edges in an H-free graph on n vertices is Q(nr). Answering a question raised by Jiang, Jiang and Ma, we show that the conjecture holds for all rationals of the form 2a=b with b sufficiently large in terms of a.
Zitieren
APA
Conlan, D., & Oliver, J. (2022). Rational Exponents Near Two. Advances in Combinatorics. https://doi.org/10.19086/aic.2022.9
Vancouver
Conlan D, Oliver J. Rational Exponents Near Two. Advances in Combinatorics. 2022. doi:10.19086/aic.2022.9
BibTeX
@article{Conlan2022,
author = {Conlan, David and Oliver, Janzer},
title = {Rational Exponents Near Two},
journal = {Advances in Combinatorics},
year = {2022},
doi = {10.19086/aic.2022.9}
}
EUVIMED