Skip to content

Problems · Vela Mathematics Program

Narrowed tonot formalized ×source:erdos-problems ×Clear all

Problem ledger

613 problems · 6/13NumberSourcesGraph view
declared disprovederdos:586
Erdős problem 586
number theorycovering systemsN/A
declared open · $100erdos:588
Erdős problem 588
geometryA006065 · A008997
declared openerdos:589
Erdős problem 589
geometrypossible
declared openerdos:597
Erdős problem 597
graph theoryramsey theoryset theoryN/A
declared open · $500erdos:601
Erdős problem 601
graph theoryset theoryN/A
declared solvederdos:603
Erdős problem 603
combinatoricsset theoryN/A3 sources
declared open · $500erdos:604
Erdős problem 604
geometrydistancespossible
declared provederdos:605
Erdős problem 605
geometrydistancespossible
declared solvederdos:606
Erdős problem 606
geometryN/A
declared proved · $250erdos:607
Erdős problem 607
geometrypossible
declared disproved (Lean)erdos:608
Erdős problem 608
graph theoryN/A2 sources
declared openerdos:609
Erdős problem 609
graph theoryramsey theorypossible
declared proved (Lean)erdos:610
Erdős problem 610
graph theorypossible4 sources
declared openerdos:611
Erdős problem 611
graph theoryN/A
declared openerdos:612
Erdős problem 612
graph theoryN/A
declared openerdos:614
Erdős problem 614
graph theorypossible
declared openerdos:616
Erdős problem 616
graph theoryN/A2 sources
declared openerdos:620
Erdős problem 620
graph theorypossible
declared provederdos:622
Erdős problem 622
graph theorypossible
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 open · $25erdos:634
Erdős problem 634
geometrypossible
declared openerdos:635
Erdős problem 635
number theoryN/A2 sources
declared provederdos:636
Erdős problem 636
graph theoryramsey theoryN/A
declared provederdos:637
Erdős problem 637
graph theoryramsey theoryN/A
declared openerdos:638
Erdős problem 638
graph theoryramsey theoryN/A
declared openerdos:640
Erdős problem 640
graph theorychromatic numberN/A
declared disprovederdos:641
Erdős problem 641
graph theoryN/A
declared openerdos:642
Erdős problem 642
graph theorycyclespossible
declared openerdos:643
Erdős problem 643
graph theoryhypergraphspossible
declared openerdos:644
Erdős problem 644
combinatoricspossible
declared disprovederdos:651
Erdős problem 651
geometryconvexpossible
declared provederdos:652
Erdős problem 652
geometrydistancesN/A2 sources
declared openerdos:654
If nn planar points have no four concyclic, must some point determine (1−o(1))n(1 - o(1))n distinct distances? Failing that, can one always force more than (1/3+c)n(1/3 + c)n?
geometrydistancespossible3 sources
declared provederdos:656
Erdős problem 656
number theoryadditive combinatoricsN/A
declared openerdos:657
Erdős problem 657
geometrydistancespossible
declared proved (Lean)erdos:658
Erdős problem 658
additive combinatoricspossible4 sources
declared openerdos:660
Erdős problem 660
geometrydistancesconvexpossible
declared open · $50erdos:661
Erdős problem 661
geometrydistancespossible
declared openerdos:662
Among sufficiently large one-separated planar point sets, does the triangular lattice maximize the number of distances below each threshold? Explicit rational oblique lattices beat the triangular lattice under several closed- and strict-shell readings.
geometrydistancesN/A3 sources
declared openerdos:663
Erdős problem 663
number theoryA391668
declared disprovederdos:664
Erdős problem 664
combinatoricsN/A
declared openerdos:665
Erdős problem 665
combinatoricsN/A2 sources
declared openerdos:667
Erdős problem 667
graph theoryramsey theoryN/A
declared openerdos:668
Erdős problem 668
geometrydistancesA385657

Search problems.science

Find a Problem, Result, source, or page