Exact Tur\'an number of the Fano plane in the 2-norm

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…