Skip to content

Problems · Vela Mathematics Program

Narrowed tonot formalized ×chromatic number ×Clear all

Problem ledger

39 problemsGraph view
declared decidable · $500erdos:19
Erdős problem 19
graph theorychromatic numberN/A
declared provederdos:57
Erdős problem 57
graph theorychromatic numbercyclesN/A
declared provederdos:58
Erdős problem 58
graph theorychromatic numbercyclesN/A
declared provederdos:63
Erdős problem 63
graph theorychromatic numbercyclesN/A
declared disprovederdos:110
Erdős problem 110
graph theorychromatic numbercyclesN/A
declared openerdos:111
Erdős problem 111
graph theorychromatic numberset theoryN/A
declared open · $1000erdos:625
Erdős problem 625
graph theorychromatic numberN/A
declared openerdos:626
Erdős problem 626
graph theorychromatic numbercyclespossible
declared openerdos:627
Erdős problem 627
graph theorychromatic numberpossible
declared openerdos:629
Erdős problem 629
graph theorychromatic numberpossible2 sources
declared provederdos:630
Erdős problem 630
graph theorychromatic numberN/A
declared provederdos:631
Erdős problem 631
graph theorychromatic numberN/A
declared disprovederdos:632
Erdős problem 632
graph theorychromatic numberN/A
declared openerdos:640
Erdős problem 640
graph theorychromatic numberN/A
declared openerdos:704
Erdős problem 704
graph theorygeometrychromatic numberN/A
declared openerdos:706
Erdős problem 706
graph theorychromatic numberpossible
declared not provableerdos:736
Erdős problem 736
graph theorychromatic numberN/A
declared provederdos:737
Erdős problem 737
graph theorychromatic numberN/A
declared openerdos:738
Erdős problem 738
graph theorychromatic numberN/A
declared not provableerdos:739
Erdős problem 739
graph theorychromatic numberN/A
declared disprovederdos:744
Erdős problem 744
graph theorychromatic numberpossible
declared solvederdos:758
Erdős problem 758
graph theorychromatic numberpossible
declared solvederdos:759
Erdős problem 759
graph theorychromatic numberpossible
declared openerdos:761
Erdős problem 761
graph theorychromatic numberN/A
declared provederdos:780
Erdős problem 780
combinatoricshypergraphschromatic numberN/A
declared provederdos:797
Erdős problem 797
graph theorychromatic numberpossible
declared provederdos:799
Erdős problem 799
graph theorychromatic numberN/A
declared disprovederdos:832
Erdős problem 832
graph theoryhypergraphschromatic numberpossible
declared provederdos:833
Erdős problem 833
graph theoryhypergraphschromatic numberpossible
declared openerdos:836
Erdős problem 836
graph theoryhypergraphschromatic numberN/A2 sources
declared provederdos:842
Erdős problem 842
graph theorychromatic numberN/A
declared openerdos:917
Erdős problem 917
graph theorychromatic numberN/A
declared openerdos:919
Erdős problem 919
graph theorychromatic numberN/A
declared provederdos:921
Erdős problem 921
graph theorychromatic numbercyclespossible
declared provederdos:922
Erdős problem 922
graph theorychromatic numberN/A
declared openerdos:1032
Do arbitrarily large 4-chromatic edge-critical graphs exist with minimum degree bounded below by a positive constant times the number of vertices?
graph theorychromatic numberpossible3 sources
declared solvederdos:1091
Erdős problem 1091
geometrychromatic numberN/A3 sources
declared openerdos:1156
Erdős problem 1156
graph theorychromatic numberN/A
declared openerdos:1177
For a finite forbidden triple system GG, what exact uncountable chromatic cardinalities occur among GG-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

Search problems.science

Find a Problem, Result, source, or page