Erdős Problem #571 — Rational exponents for bipartite forbidden graphs
For a finite simple graph , let be the maximum number of edges in a simple graph on vertices that contains no subgraph isomorphic to ; the forbidden copy need not be induced. The question asks: for every rational number with , does there exist a finite bipartite graph and constants and such that, for every integer ,
The graph and constants may depend on . Equivalently, the question asks for as . Erdős Problem #571
Background
This is a question about which growth rates can occur for the extremal number of a single forbidden bipartite graph. Erdős and Simonovits raised the single-graph problem; it is distinct from the finite-forbidden-family analogue. Bukh and Conlon's random-algebraic approach to that broader setting also supplied a framework for lower bounds relevant to the single-graph question. Jiang, Ma and Yepremyan, On Turán exponents of bipartite graphs Rational exponents near 3/2
In that framework, a rooted bipartite graph consists of a graph and a proper subset designated as its roots. For nonempty , let count the edges incident to at least one vertex of , and set and . The pair is balanced if for every nonempty . Its rooted power is formed from copies of identified on and otherwise disjoint. Bukh and Conlon proved that if is balanced and , then for some and every integer ,
This is a lower bound; by itself it does not give a matching upper bound. Rational exponents near 3/2
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.