Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2007.02975 v3 pith:NDMAQ7S5 submitted 2020-07-06 math.CO

Negligible obstructions and Tur\'an exponents

classification math.CO
keywords exponentslfloornumberrfloorbukh--conlonbyproductconjectureevery
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We show that for every rational number $r \in (1,2)$ of the form $2 - a/b$, where $a, b \in \mathbb{N}^+$ satisfy $\lfloor b/a \rfloor^3 \le a \le b / (\lfloor b/a \rfloor +1) + 1$, there exists a graph $F_r$ such that the Tur\'an number $\operatorname{ex}(n, F_r) = \Theta(n^r)$. Our result in particular generates infinitely many new Tur\'an exponents. As a byproduct, we formulate a framework that is taking shape in recent work on the Bukh--Conlon conjecture.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.