Constructions of Turán systems that are tight up to a multiplicative constant
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
For positive integers n ⩾ s > r , the Turán function T ( n , s , r ) is the smallest size of an r -graph with n vertices such that every set of s vertices contains at least one edge. Also, define the Turán density t ( s , r ) as the limit of T ( n , s , r ) / ( n r ) as n → ∞ . The question of estimating these parameters received a lot of attention after it was first raised by Turán in 1941. A trivial lower bound is t ( s , r ) ⩾ 1 / ( s s − r ) . In the 1990s, de Caen conjectured that r ⋅ t ( r + 1 , r ) → ∞ as r → ∞ and offered 500 Canadian dollars for resolving this question. We disprove this conjecture by showing more strongly that for every integer R ⩾ 1 there is μ R (in fact, μ R can be taken to grow as ( 1 + o ( 1 ) ) R ln R ) such that t ( r + R , r ) ⩽ ( μ R + o ( 1 ) ) / ( r + R R ) as r → ∞ , that is, the trivial lower bound is tight for every R up to a multiplicative constant μ R .
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it