Research-page premise
Erdős's work repeatedly converts a problem into a compact combinatorial or arithmetical obstruction: a density threshold, a forbidden configuration, a probabilistic existence estimate, a divisibility poset, a Ramsey dichotomy, or a collaboration-ready conjecture. This page reconstructs that operating system as a decision tree over a uniformly sampled corpus of 300 publication-level cases drawn from the Grossman bibliography.
The reconstruction intentionally avoids full-text reproduction. It uses bibliographic titles and derived thesis/result summaries as the observable layer, then infers strategy tags as a probabilistic ensemble.
Thirty-three reconstructed strategies
Click a strategy card to see the working rule, formula schema, and evidence sample.
Overlapping prevalence ranking
Percentages mean “share of the 300 cases tagged with this strategy.” Strategies are not mutually exclusive; because each case carries three tags, totals may exceed 100%.
300 publication / chapter-style cases
| # | Year | Publication / lecture case | Domain | Thesis / result | Strategies |
|---|