当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
A generalization of the Kővári-Sós-Turán theorem
arXiv - CS - Discrete Mathematics Pub Date : 2020-02-13 , DOI: arxiv-2002.05336
Jesse Geneson

We present a new proof of the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem that $ex(n, K_{s,t}) = O(n^{2-1/t})$. The new proof is elementary, avoiding the use of convexity. For any $d$-uniform hypergraph $H$, let $ex_d(n,H)$ be the maximum possible number of edges in an $H$-free $d$-uniform hypergraph on $n$ vertices. Let $K_{H, t}$ be the $(d+1)$-uniform hypergraph obtained from $H$ by adding $t$ new vertices $v_1, \dots, v_t$ and replacing every edge $e$ in $E(H)$ with $t$ edges $e \cup \left\{v_1\right\},\dots, e \cup \left\{v_t\right\}$ in $E(K_{H, t})$. If $H$ is the $1$-uniform hypergraph on $s$ vertices with $s$ edges, then $K_{H, t} = K_{s, t}$. We prove that $ex_{d+1}(n,K_{H,t}) = O(ex_d(n, H)^{1/t} n^{d+1-d/t})$. Thus $ex_{d+1}(n,K_{H,t}) = O(n^{d+1-1/t})$ for any $d$-uniform hypergraph $H$ with $ex_d(n, H) = \Theta(n^{d-1})$, which implies the K\H{o}v\'{a}ri-S\'{o}s-Tur\'{a}n theorem in the $d = 1$ case. As a corollary, this implies that $ex_{d+1}(n, K_{H,t}) = O(n^{d+1-1/t})$ when $H$ is a $d$-uniform hypergraph in which all edges are pairwise disjoint, which generalizes an upper bound proved by Mubayi and Verstra\"{e}te (JCTA, 2004). We also obtain analogous bounds for 0-1 matrix Tur\'{a}n problems.
更新日期:2020-02-14

 

全部期刊列表>>
宅家赢大奖
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
西湖大学
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
香港大学化学系刘俊治
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug