Negligible obstructions and Turán exponents

Abstract: The conjecture on the realizability of rational exponents states that for every rational number r in (1,2) there is a graph F such that ex(n, F) = Θ(n^r). In their beautiful work, Bukh and Conlon resolved a weaker version of the conjecture, where F is allowed to be a family of graphs. Subsequent work has been focusing on narrowing this family down to a single graph. We formulate a framework, that is taking shape in recent work, to attack the conjecture, and we showcase an application of the framework to obtain infinitely many new Turán exponents.

Joint work with Tao Jiang and Jie Ma.

combinatorics

Audience: researchers in the topic

( paper )

---

SCMS Combinatorics Seminar

Series comments: Check scmscomb.github.io/ for more information

---