Year: 2022
Type: article
Abstract: 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.
Source: Advances in Combinatorics
DOI: 10.19086/aic.2022.9
Authors: David Conlan, Janzer Oliver
Institutions: California Institute of Technology, University of Cambridge
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
Funder: National Science Foundation
OpenAlex ID: W4310690328