Skip to content
Preprint

On the Exact Tur\'an Number of $F^-_{4,3}$

Sep 2026 · 0 citations · 11 references
Mathematics

Abstract

For a $3$-graph $F$, the Tur\'an number of $F$, denoted by $\ex(n,F)$, is the maximum number of edges in a $3$-graph on $n$ vertices containing no subgraph isomorphic to $F$. Let $F^-_{4,3}$ be the $3$-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 $n\ge8$, \[ \ex(n,F^-_{4,3})=\binom n3-\binom{\lfloor n/2\rfloor}{3}-\binom{\lceil n/2\rceil}{3}, \] and the balanced complete bipartite $3$-graph is the unique extremal configuration. This determines the exact value and all equality cases in the asymptotic theorem of Mubayi and R\"odl. It also extends the exact Tur\'an Number of $F_{3,3}$ and resolves a conjecture of Frankl, Huang and R\"odl.

View source

Similar papers

Preprint Sep 2026

Tur\'an problems with bounded matching number in $k$-uniform hypergraphs

For a family $\mathcal{F}$ of $k$-graphs, $ex_k(n,\mathcal{F})$ denotes the maximum number of edges in an $n$-vertex $\mathcal{F}$-free $k$-graph. Let $M_{s+1}^k$ denote a matching of size $s+1$ in $k$-uniform hypergraphs. Recently, Alon and Frankl (JCTB, 2024) determined $ex_2(n,\{M_{s+1}^2,K_{\ell+1}\})$ for all $n\g...

Jia-Lin Liu, Ming-Yang Guo, Xiu-Mei Wang · 0 citations
Preprint Sep 2026

An Improved Upper Bound for the Tur\'an Number of the Hexagon

For a graph $F$, the Tur\'an number $\operatorname{ex}(n,F)$ is the maximum number of edges in an $n$-vertex graph containing no copy of $F$. Determining the Tur\'an numbers of even cycles is a central problem in extremal graph theory and remains open in general. For $C_6$, the best previous upper bound was due to F\"u...

Sandip Das, Sk Samim Islam, A. Mohapatra et al. · 0 citations
Preprint Sep 2026

A Tur\'an-type extremal problem for the number of spanning trees in $C_4$-free graphs

For a graph \(F\), the Tur\'an number \(\ex(n,F)\) is the maximum number of edges in an \(F\)-free graph on \(n\) vertices. Let \(q\ge 2\) be an integer and set \(n=q^{2}+q+1\). Brown and Erd\H{o}s, R\'enyi and S\'os independently proved that $\ex(n,C_{4})\ge \frac12 q(q+1)^{2}$ for every prime power \(q\), and F\"ured...

Shao-Han Xu, Feng-Ming Dong, Ke-Xiang Xu · 0 citations
Preprint Oct 2026

$K_r$-Packings in Graphs with $t_{r-1}(n)+k$ Edges

Fix an integer $r\ge 3$. Let $K_r$ denote the complete graph on $r$ vertices and $t_{r-1}(n)$ the Tur\'an number for $K_r$. For each integer $k$ satisfying $0\le k \le \binom{n}{2}-t_{r-1}(n)$, $\rev{\phi_r(n,k)}$ denotes the minimum, over all $n$-vertex graphs with $t_{r-1}(n)+k$ edges, of the maximum size of a $K_r$-...

Han-Zhi Bai, Fu-Hong Ma, Jin Yan · 0 citations
Preprint Oct 2026

Sharp bounds for Duke--Erd\H{o}s--R\"odl problems on cycle-connected subgraphs

For $k\ge2$, a graph is $C_{2k}$-connected if every two distinct edges lie together on an even cycle of length at most $2k$ in that graph. Let $f_k(n,m)$ be the largest number of edges in a $C_{2k}$-connected subgraph that every $n$-vertex graph with $m$ edges must contain. In this paper, we study two cycle-connected p...

Guo-Rong Gao, Run-Han Zhao · 0 citations
Preprint Sep 2026

An improved lower bound for the packing number of the 2-token graph of the cycle

Let $F_2(C_n)$ be the $2$-token graph of the cycle $C_n$ and let $\rho$ denote the packing number. G\'omez Soto and R\'ios-Castro recently proved that $\rho(F_2(C_n))\ge a(n)$ for $n\ge 19$, where $a(n)$ is an explicit expression. In this note, we prove that \[ \rho(F_2(C_n))\ \ge\ \left\lfloor\frac{n(n-2)}{10}\right\r...

Luis Manuel Rivera · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.