Three Erdős Problems and the Boundary of Witnessed Closure

This paper collects three elementary results from a formalized corpus of Erdős problems: the subset-sum injection bound, the complement-pairing bound for two-intersecting families, and a non-vacuity construction for the Erdős–Faber–Lovász hypothesis. Each result has an explicit witness and a complete checked proof. The results are deliberately separated from the stronger open or deep theorems that motivate them. The sharp distinct-subset-sum problem, the Frankl–Füredi extremal problem, and the full Erdős–Faber–Lovász theorem require methods not used here. The purpose of the paper is to state precisely what the elementary arguments prove and where they stop.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-21
DOI
https://doi.org/10.5281/zenodo.22883471
Primary Topic
Complexity and Algorithms in Graphs
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Three Erdős Problems and the Boundary of Witnessed Closure

Christopher Mills
Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
preprint

Three Erdős Problems and the Boundary of Witnessed Closure

Christopher Mills
preprint en

Abstract

This paper collects three elementary results from a formalized corpus of Erdős problems: the subset-sum injection bound, the complement-pairing bound for two-intersecting families, and a non-vacuity construction for the Erdős–Faber–Lovász hypothesis. Each result has an explicit witness and a complete checked proof. The results are deliberately separated from the stronger open or deep theorems that motivate them. The sharp distinct-subset-sum problem, the Frankl–Füredi extremal problem, and the full Erdős–Faber–Lovász theorem require methods not used here. The purpose of the paper is to state precisely what the elementary arguments prove and where they stop.

Zenodo (CERN European Organization for Nuclear Research)
Complexity and Algorithms in Graphs
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Three Erdős Problems and the Boundary of Witnessed Closure — Christopher Mills · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS