首页> 外文期刊>Graphs and combinatorics >A Note on Non-jumping Numbers for r-Uniform Hypergraphs
【24h】

A Note on Non-jumping Numbers for r-Uniform Hypergraphs

机译:关于R均匀超图的非跳数的注释

获取原文
获取原文并翻译 | 示例
       

摘要

A real number is a jump for an integer if there exists a constant such that any number in cannot be the Turan density of a family of r-uniform graphs. ErdAs and Stone showed that every number in [0,1) is a jump for . ErdAs asked whether the same is true for . Frankl and Rodl gave a negative answer by showing the existence of non-jumps for . Recently, Baber and Talbot showed that every number in is a jump for using Razborov's flag algebra method. Pikhurko showed that the set of non-jumps for every has cardinality of the continuum. But, there are still a lot of unknowns regarding jumps for hypergraphs. In this paper, we show that is a non-jump for and which generalizes some earlier results. We do not know whether the same result holds for . In fact, when and , , and determining whether is a jump or not for is perhaps the most important unknown question regarding this subject. ErdAs offered $500 for answering this question.
机译:如果存在常数,则实际数字是整数的跳跃,使得任何不可能成为R构成图形家族的卷发密度。 Erdas和Stone表明[0,1)中的每个数字都是跳跃。 Erdas询问是否是真的。 弗兰克和Rodl通过表现出非跳跃的存在,给出了负面答案。 最近,Baber和Talbot表明,每个数字都是使用Razborov的标志代数方法的跳跃。 Pikhurko表明,每一个具有连续体的基数的非跳跃集合。 但是,关于超图的跳跃仍有很多未知数。 在本文中,我们表明这是一个非跳跃,并概括了一些早期的结果。 我们不知道是否具有相同的结果。 事实上,何时何地,以及确定是否跳跃,也许是关于这个主题的最重要的未知问题。 Erdas提供500美元用于回答这个问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号