A note on the jumping constant conjecture of Erdős (Q864899): Difference between revisions

Let \(r\geq 2\) be an integer. The real number \(\alpha\in [0,1]\) is a jump for \(r\) if there exists \(c>0\) such that for all \(\varepsilon>0\) and for every integer \(m\geq r,\) every \(r\)-uniform graph with \(n> n_0(\varepsilon,m)\) vertices and at least \((\alpha+\varepsilon){n \choose r}\) edges contains a subgraph with \(m\) vertices and at least \((\alpha+c){m \choose r}\) edges. This paper describes an infinite series of nonjumping numbers for \(r=3\) and also shows that \({5\over 2}{r! \over r^r}\) is not a jump for \(r\geq 3.\)