Generating non-jumping numbers recursively

@article{Peng2008GeneratingNN,
  title={Generating non-jumping numbers recursively},
  author={Yuejian Peng and Cheng Zhao},
  journal={Discrete Applied Mathematics},
  year={2008},
  volume={156},
  pages={1856-1864}
}
Let r 2 be an integer. A real number ∈ [0, 1) is a jump for r if there is a constant c > 0 such that for any > 0 and any integer m where m r , there exists an integer n0 such that any r-uniform graph with n > n0 vertices and density + contains a subgraph with m vertices and density + c. It follows from a fundamental theorem of Erdős and Stone that every ∈ [0, 1) is a jump for r = 2. Erdős asked whether the same is true for r 3. Frankl and Rödl gave a negative answer by showing some non-jumping… CONTINUE READING

From This Paper

Topics from this paper.
4 Citations
11 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Maxima for graphs and a new proof of a theorem of Turán

  • T. S. Motzkin, E. G. Straus
  • Canad. J. Math. 17
  • 1965
1 Excerpt

Similar Papers

Loading similar papers…