A classical object in hypergraph Turán theory is the Fano plane , the unique linear -graph on seven vertices with seven edges. The Turán density and exact Turán number of , first proposed as a problem by Sós \cite{Sos76} in the 1970s, were determined through a sequence of works by De Caen-Füredi \cite{DCF00}, Füredi-Simonovits \cite{FS05}, Keevash-Sudakov \cite{KS05}, and Bellmann-Reiher \cite{BR19}. Addressing a conjecture of Balogh-Clemen-Lidický \cite[Conjecture 3.1]{BCL22a}, we establish an Andrásfai-Erdős-Sós-type stability theorem for in the -norm: there exists a positive constant such that for large , every -free -graph on vertices with minimum -norm degree at least must be bipartite. As a consequence, for large , the balanced complete bipartite -graph is the unique extremal construction for the -norm Turán problem of , thereby confirming the conjecture of Balogh-Clemen-Lidický. Our proof includes a refinement of a classical result by Ahlswede-Katona \cite{AK78} on counting stars, and the establishment of an Andrásfai-Erdős-Sós-type theorem for a multigraph Turán problem studied by Bellmann-Reiher \cite{BR19}, both of which are of independent interest.

生成讲解博客的中文版本

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