Problems · Vela Mathematics Program

declared provederdos:58

Erdős problem 58

declared disprovederdos:59

Erdős problem 59

graph theoryturan numberN/A

declared openerdos:62

Erdős problem 62

declared provederdos:63

Erdős problem 63

declared openerdos:65

Erdős problem 65

graph theorycyclesN/A

declared proved · $100erdos:72

Erdős problem 72

graph theorycyclesN/A

declared provederdos:73

Erdős problem 73

declared provederdos:76

Erdős problem 76

graph theoryramsey theoryA060407

declared open · $250erdos:77

Erdős problem 77

graph theoryramsey theoryA059442

declared open · $100erdos:78

Erdős problem 78

graph theoryramsey theoryA0594422 sources

declared provederdos:79

Erdős problem 79

declared openerdos:80

Erdős problem 80

declared openerdos:81

Erdős problem 81

graph theorypossible2 sources

declared openerdos:84

Erdős problem 84

graph theorycyclespossible

declared open · $100erdos:86

Erdős problem 86

graph theoryA245762

declared openerdos:87

Erdős problem 87

graph theoryramsey theoryA059442 · possible

declared proved · $100erdos:88

Erdős problem 88

declared disprovederdos:110

Erdős problem 110

graph theorychromatic numberset theoryN/A

declared openerdos:111

Erdős problem 111

declared openerdos:112

Erdős problem 112

declared disproved · $500erdos:113

Erdős problem 113

graph theoryturan numberN/A

declared provederdos:127

Erdős problem 127

graph theorypossible

declared openerdos:129

Erdős problem 129

declared disprovederdos:133

Erdős problem 133

graph theorypossible

declared solvederdos:136

Erdős problem 136

graph theorypossible

declared disproved · $500erdos:147

Erdős problem 147

graph theoryturan numberN/A

declared openerdos:149

Erdős problem 149

declared openerdos:151

Erdős problem 151

graph theorypossible

declared openerdos:159

Erdős problem 159

declared provederdos:163

Erdős problem 163

declared open · $250erdos:165

Erdős problem 165

graph theoryramsey theoryA0007912 sources

declared proved · $250erdos:166

Erdős problem 166

graph theoryramsey theoryA059442

declared falsifiableerdos:167

Erdős problem 167

declared openerdos:181

Erdős problem 181

declared provederdos:182

Erdős problem 182

graph theorypossible

declared open · $500erdos:500

Erdős problem 500

graph theoryhypergraphsturan numberA140462

declared provederdos:518

Erdős problem 518

declared openerdos:544

Erdős problem 544

graph theoryramsey theoryA000791

declared openerdos:545

Erdős problem 545

graph theoryramsey theoryA059442 · possible

declared provederdos:546

Erdős problem 546

declared decidableerdos:547

Erdős problem 547

declared falsifiableerdos:548

Erdős problem 548

declared disprovederdos:549

Erdős problem 549

be sufficiently large. If

declared openerdos:550

Let

m_1\leq\cdots\leq m_k

and

n

T

is a tree on

n

vertices and

G

is the complete multipartite graph with vertex class sizes

m_1,\ldots,m_k

, prove that

R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1

graph theoryramsey theoryN/A4 sources

declared decidableerdos:551

Erdős problem 551

declared openerdos:552

Erdős problem 552

graph theoryramsey theoryA006672

declared provederdos:553

Erdős problem 553

graph theoryramsey theoryA000791 · possible

declared openerdos:554

Erdős problem 554