加载中…
Given a graph , the extremal number is the maximum number of edges in an -vertex graph not containing as a subgraph. The well-known rational exponents conjecture of Erd\H{o}s and Simonovits states that for any rational there exists a single bipartite graph satisfying . Among other results, the conjecture has been verified for all , where , by Jiang and Qiu and for all , where , by Conlon and Janzer. In this paper, we establish the rational exponents conjecture for many near the center of the interval, namely, for all , where are natural numbers satisfying , .

生成讲解博客的中文版本

生成AI智能校验的中文版本