Skip to content
Preprint

Robust Repulsion for Growing Crowns in Linear Hypergraphs

Aug 2026 · 0 citations · 3 references
Mathematics

Abstract

Put $q=r-1$, $t=k-1$, and $D=tq+1$. For an edge $e$ of a linear $C^r_{1,k}$-free $r$-uniform hypergraph, define \[ \delta_H(e)=\sum_{v\in e}\frac{1}{d_H(v)}-\frac{r}{D}. \] The defect satisfies $\delta_H(e)\ge 0$. At equality, every vertex of $e$ has degree $D$, and the petal trace at $e$ is a disjoint union of $t$ affine planes of order $q$. Equivalently, restoring the base line gives $t$ projective planes of order $q$ with common line $e$. For growing crowns, the equality structure is stable in the following sense. If $q_j\to\infty$, $2\le t_j\le q_j$, and $e_j$ is an edge of a finite linear $C_{1,t_j+1}^{q_j+1}$-free hypergraph satisfying \[ \frac{t_j^2}{q_j}\to0, \qquad t_j^3\delta_{H_j}(e_j)\to0, \] then, for every fixed $0<\theta<1$, \[ \frac{ |\{f\ne e_j:f\cap e_j\ne\varnothing,\ \delta_{H_j}(f)\ge\theta/t_j^2\}| }{(q_j+1)(t_jq_j)} \to1. \] Thus an edge close to equality is adjacent almost entirely to edges with defect of order at least $t_j^{-2}$. A uniform form gives absolute constants $Q_0,\varepsilon_0,c_0>0$ such that, whenever $q\ge Q_0t^2$ and $\delta_H(e)<\varepsilon_0/t^3$, at least $\tfrac12(q+1)tq$ neighbors of $e$ have defect at least $1/(100t^2)$. Consequently, \[ c^{\mathrm{lin}}_{q+1,t+1}\le t-\frac{c_0}{t}, \] where $c^{\mathrm{lin}}_{r,k}$ denotes the asymptotic linear Tur\'an coefficient for $C^r_{1,k}$.

View source

Similar papers

Preprint Aug 2026

Blocking Amalgamations, Maximal Arcs, and Generalized Crowns

Let $C^r_{1,k}$ be the $r$-uniform $k$-crown and put $h=r-k+2$. For a finite linear intersecting $r$-uniform hypergraph $G$, let $\tau_h(G)$ be the minimum size of a set meeting every edge of $G$ in at least $h$ vertices, and define \[ \rho_{r,k}=\sup_G\frac{|E(G)|}{\tau_h(G)}. \] We prove that every fixed pair $(G,B)$...

Mahesh Ramani · 0 citations
Preprint Oct 2026

Tur\'an densities of hypergraph augmentations

For a $t$-graph $F$ and an integer $r\ge t$, the \emph{$r$-augmentation} $F(r)$ is the $r$-graph obtained by adding the same set of $r-t$ new vertices to every edge of $F$. We investigate the behaviour of the \emph{Tur\'an density $\pi(F(r))$}, which is the asymptotically maximum edge density of a large $F(r)$-free $r$...

Oleg Pikhurko, Jia-Bao Yang, Xiu-Tao Zhu · 0 citations
Preprint Oct 2026

Coordinate-extension degrees and layered $k$-uniform hypergraphs

Let $\Palt=(\C,\T)$ be a $k$-palette. For $0\le t\le k-1$, its $t$th coordinate-extension degree is the minimum, over every choice of $t$ coordinates and every assignment of colors to them, of the proportion of assignments to the remaining $k-t$ coordinates that complete the fixed colors to an admissible $k$-tuple. For...

Jia-Bao Yang · 0 citations
Preprint Oct 2026

The threshold for fractional clique decompositions of random hypergraphs, via matrix scaling

Let $\delta^*_{k,r}$ be the fractional $K_r^{(k)}$-decomposition threshold in minimum codegree. For fixed $k\ge2$, $r\ge k+1$ and $\varepsilon>0$, we prove that every $n$-vertex $k$-uniform hypergraph $G$ with minimum codegree at least $(\delta^*_{k,r}+\varepsilon)n$ admits, with high probability, a fractional $K_r^{(k...

Tuan Tran · 0 citations
Preprint Aug 2026

Clique-saturating non-edges throughout the Tur\'an range

For an $F$-free graph $G$, a non-edge is $F$-saturating if adding it to $G$ creates a copy of $F$. We denote by $f_{p+1}(n,m)$ the minimum number of $K_{p+1}$-saturating non-edges in a $K_{p+1}$-free $n$-vertex graph with $m$ edges. Erd\H{o}s and Tuza conjectured that $f_4\left(n,\mathrm{ex}(n,K_3)+ 1\right)= (1 + o(1)...

Xiao-Lin Wang, Jia-Bao Yang, Rui-Lin Zheng · 0 citations
Preprint Aug 2026

An asymptotic solution to the Erd\H{o}s four-edge intersection problem

For an $n$-vertex graph $G$ and a permutation $\sigma$ of its vertex set, let $\sigma(G)$ denote the corresponding relabelling of $G$, and put $I_G(\sigma)=|E(G)\cap E(\sigma(G))|$. Let $f(n,k)$ be the minimum number of edges in an $n$-vertex graph for which $I_G(\sigma)\geq k$ for every $\sigma$. In his 1977 formulati...

Andrzej Żak · 0 citations

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