期刊论文详细信息
Electronic Journal Of Combinatorics
Note on Upper Density of Quasi-Random Hypergraphs
Vindya Bhat1 
关键词: hypergraphs;    density;    quasi-random;    jumps;   
DOI  :  
学科分类:离散数学和组合数学
来源: Electronic Journal Of Combinatorics
PDF
【 摘 要 】

In 1964, Erdős proved that for any $\alpha > 0$, an $l$-uniform hypergraph $G$ with $n \geq n_0(\alpha, l)$ vertices and $\alpha \binom{n}{l}$ edges contains a large complete $l$-equipartite subgraph. This implies that any sufficiently large $G$ with d

【 授权许可】

Others   

【 预 览 】
附件列表
Files Size Format View
RO201909029188867ZK.pdf 309KB PDF download
  文献评价指标  
  下载次数:8次 浏览次数:8次