当前位置: X-MOL 学术Combinatorica › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Construction for Clique-Free Pseudorandom Graphs
Combinatorica ( IF 1.0 ) Pub Date : 2020-03-05 , DOI: 10.1007/s00493-020-4226-6
Anurag Bishnoi , Ferdinand Ihringer , Valentina Pepe

A construction of Alon and Krivelevich gives highly pseudorandom K k -free graphs on n vertices with edge density equal to Θ ( n −1=( k −2) ). In this short note we improve their result by constructing an infinite family of highly pseudorandom K k -free graphs with a higher edge density of Θ ( n −1=( k −1) ).

中文翻译:

无群伪随机图的构造

Alon 和 Krivelevich 的构造在边密度等于 Θ ( n -1=( k -2) ) 的 n 个顶点上给出了高度伪随机的 K k 自由图。在这个简短的说明中,我们通过构建具有更高边密度 Θ ( n -1=( k -1) ) 的高度伪随机 K k 自由图的无限族来改进他们的结果。
更新日期:2020-03-05
down
wechat
bug