Skip to content

Erdős Problems

1,217 source-owned questions · 604 with a formal statement · searchable by statement, number, topic and source status.

Add a contributionCollection details
Full distribution

Collection coverage

Source status, exact formal material, and reviewed Results are separate signals.

  • Open per source608
  • Resolved per source556
  • Other source status53
Exact formal statement available604 / 1,217
With Repository-reviewed evidence2 / 1,217
More filters

Coverage is source-observation coverage, not Problem completeness. Inspect coverage

Problems

23 Problems

SelectNumberQuestionOpen
#59No statement retained — open to read what the source holdsSource says disprovedNo formal declaration
#113No statement retained — open to read what the source holdsSource says disprovedNo formal declaration
#146If HH is bipartite and is rr-degenerate, that is, every induced subgraph of HH has minimum degree ≤r\leq r, then ex(n;H)≪n2−1/r.\mathrm{ex}(n;H) \ll n^{2-1/r}.Source says open (Lean)Formalized
#147No statement retained — open to read what the source holdsSource says disprovedNo formal declaration
#180If F\mathcal{F} is a finite set of finite graphs then ex(n;F)\mathrm{ex}(n;\mathcal{F}) is the maximum number of edges a graph on nn vertices can have without containing any subgraphs from F\mathcal{F}. Note that it is trivial that ex(n;F)≤ex(n;G)\mathrm{ex}(n;\mathcal{F})\leq \mathrm{ex}(n;G) for every G∈FG\in\mathcal{F}. Is it true that, for every F\mathcal{F}, there exists G∈FG\in\mathcal{F} such that ex(n;G)≪Fex(n;F)?\mathrm{ex}(n;G)\ll_{\mathcal{F}}\mathrm{ex}(n;\mathcal{F})?Source says open (Lean)Formalized
#500No statement retained — open to read what the source holdsSource says openNo formal declaration
#571No statement retained — open to read what the source holdsSource says openNo formal declaration
#572No statement retained — open to read what the source holdsSource says openNo formal declaration
#573No statement retained — open to read what the source holdsSource says openNo formal declaration
#574No statement retained — open to read what the source holdsSource says disprovedNo formal declaration
#575No statement retained — open to read what the source holdsSource says openNo formal declaration
#576No statement retained — open to read what the source holdsSource says openNo formal declaration
#579Let δ>0\delta > 0. If nn is sufficiently large and GG is a graph on nn vertices with no K2,2,2K_{2,2,2} (the octahedron) and at least δn2\delta n^2 edges, must GG contain an independent set of size ≫δn\gg_\delta n?Source says openFormalized
#712No statement retained — open to read what the source holdsSource says openNo formal declaration
#713No statement retained — open to read what the source holdsSource says openNo formal declaration
#714No statement retained — open to read what the source holdsSource says openNo formal declaration
#765No statement retained — open to read what the source holdsSource says solved (Lean)No formal declaration
#766No statement retained — open to read what the source holdsSource says openNo formal declaration
#767No statement retained — open to read what the source holdsSource says provedNo formal declaration
#794Is it true that every 33-uniform hypergraph on 3n3n vertices with at least n3+1n^3+1 edges must contain either a subgraph on 44 vertices with 33 edges or a subgraph on 55 vertices with 77 edges?Source says disproved (Lean)Formalized
#1079No statement retained — open to read what the source holdsSource says solvedNo formal declaration
#1157No statement retained — open to read what the source holdsSource says openNo formal declaration
#1158No statement retained — open to read what the source holdsSource says openNo formal declaration