A generalized Ramsey number framework is introduced, with polynomial characterizations, and several prime-gap problems are re-expressed as existence of these numbers, largely by construction.
In: Graphs and Combina- torics: Proceedings of the Capital Conference on Graph Theo ry and Combinatorics at the George W ashington University June 18–22, 1973, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Ramsey-Theoretic Characterizations of Classically Non-Ramseyian Problems
A generalized Ramsey number framework is introduced, with polynomial characterizations, and several prime-gap problems are re-expressed as existence of these numbers, largely by construction.