201. A note on the jumping constant conjecture of Erdős
- Author
-
Frankl, Peter, Peng, Yuejian, Rödl, Vojtech, and Talbot, John
- Subjects
- *
COMPLEX numbers , *GRAPH theory , *ALGEBRAIC number theory , *MATHEMATICAL sequences , *COMBINATORICS - Abstract
Abstract: Let be an integer. The real number is a jump for r if there exists such that for every positive ϵ and every integer , every r-uniform graph with vertices and at least edges contains a subgraph with m vertices and at least edges. A result of Erdős, Stone and Simonovits implies that every is a jump for . For , Erdős asked whether the same is true and showed that every is a jump. Frankl and Rödl gave a negative answer by showing that is not a jump for r if and . Another well-known question of Erdős is whether is a jump for and what is the smallest non-jumping number. In this paper we prove that is not a jump for . We also describe an infinite sequence of non-jumping numbers for . [Copyright &y& Elsevier]
- Published
- 2007
- Full Text
- View/download PDF