Skip to content

Home
Problems
Frontiers
Updates

Overview
Problem ledger
Assertions
Proposed changes
Commits
Reproduce

Add contribution

/Problems

Problems · Vela Mathematics Program

Narrowed tonot formalized ×hypergraphs ×Clear all

Declared status

open0 / 13
proved0 / 4
solved0 / 3
disproved0 / 1
falsifiable0 / 1
proved (Lean)0 / 1

Status and formalization as the source record declares them, across two upstream serializations this product does not merge. Neither is a Vela standing. These 23 are source-native problems, not Claims: no Claim binds them and none carries a Verification.

Formalization

not formalized23
formalized8

Subject tag

number theory216
graph theory199
ramsey theory83
geometry60
additive combinatorics50
analysis42
chromatic number39
combinatorics32

›32 more subjects

Contributing source

source:erdos-problems23
source:erdos-ai-contributions-wiki3
source:jayyhk-erdos-lean1
source:vibemathed1

Problem ledger

23 problemsGraph view

declared provederdos:207

Erdős problem 207

combinatoricshypergraphsN/A

declared open · $500erdos:500

Erdős problem 500

graph theoryhypergraphsturan numberA140462

declared openerdos:563

Erdős problem 563

graph theoryramsey theoryhypergraphsN/A

declared openerdos:643

Erdős problem 643

graph theoryhypergraphspossible

declared open · $500erdos:712

Erdős problem 712

graph theoryturan numberhypergraphspossible

declared proved (Lean)erdos:716

Erdős problem 716

graph theoryhypergraphspossible3 sources

declared openerdos:719

Erdős problem 719

graph theoryhypergraphspossible

declared solvederdos:747

Erdős problem 747

combinatoricshypergraphsN/A

declared provederdos:780

Erdős problem 780

combinatoricshypergraphschromatic numberN/A

declared disprovederdos:832

Erdős problem 832

graph theoryhypergraphschromatic numberpossible

declared provederdos:833

Erdős problem 833

graph theoryhypergraphschromatic numberpossible

declared solvederdos:834

Erdős problem 834

graph theoryhypergraphsN/A

declared openerdos:836

Erdős problem 836

graph theoryhypergraphschromatic numberN/A2 sources

declared openerdos:837

Erdős problem 837

graph theoryhypergraphsN/A

declared openerdos:901

Erdős problem 901

combinatoricshypergraphspossible

declared falsifiableerdos:1020

Erdős problem 1020

graph theoryhypergraphsN/A

declared solvederdos:1024

Erdős problem 1024

graph theoryhypergraphspossible

declared openerdos:1075

Erdős problem 1075

declared provederdos:1076

Erdős problem 1076

hypergraphspossible

declared openerdos:1157

Erdős problem 1157

hypergraphsturan numberpossible

declared openerdos:1158

Erdős problem 1158

hypergraphsturan numberpossible

declared openerdos:1177

For a finite forbidden triple system

G

, what exact uncountable chromatic cardinalities occur among

G

-free triple systems, and how do those spectra interact? The revised manuscript answers the three exact-cardinal questions and claims a complete spectrum dichotomy.

set theorychromatic numberhypergraphsN/A3 sources

declared openerdos:1178

Erdős problem 1178

graph theoryhypergraphsN/A

Search problems.science

Find a Problem, Result, source, or page