加载中…
For a -graph , the Turán number of , denoted by , is the maximum number of edges in a -graph on vertices containing no subgraph isomorphic to . Let be the -graph formed by a complete four-vertex core and three outer vertices, with all but one of the twelve triples containing one core vertex and two outer vertices. We prove that, for every , and the balanced complete bipartite -graph is the unique extremal configuration. This determines the exact value and all equality cases in the asymptotic theorem of Mubayi and Rödl. It also extends the exact Turán Number of and resolves a conjecture of Frankl, Huang and Rödl.

生成讲解博客的中文版本

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