Problems · Vela Mathematics Program

analysisprobabilitypolynomialsN/A

declared provederdos:523

Erdős problem 523

declared openerdos:524

Erdős problem 524

analysisprobabilitypolynomialsN/A3 sources

declared provederdos:525

Erdős problem 525

analysisprobabilitypolynomialspossible

declared solvederdos:526

Erdős problem 526

probabilitygeometryN/A

declared provederdos:527

Erdős problem 527

analysisprobabilityN/A

declared openerdos:528

Erdős problem 528

geometryA387897 · A156816

declared openerdos:529

Erdős problem 529

geometryprobabilityN/A

declared openerdos:530

Erdős problem 530

number theorysidon setsA143824 · possible

declared openerdos:531

Erdős problem 531

number theoryramsey theorypossible

declared solvederdos:534

Erdős problem 534

number theoryintersecting familyA387543 · A387698

declared solvederdos:542

Erdős problem 542

number theoryN/A

declared disprovederdos:543

Erdős problem 543

number theorygroup theorypossible3 sources

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

declared openerdos:555

Erdős problem 555

graph theoryramsey theoryA389313 · possible

declared decidableerdos:556

Erdős problem 556

graph theoryramsey theoryA389335

declared openerdos:557

Erdős problem 557

declared openerdos:558

Erdős problem 558

declared disprovederdos:559

Erdős problem 559

declared openerdos:560

Erdős problem 560

declared openerdos:561

Erdős problem 561

graph theoryramsey theoryhypergraphsN/A

declared openerdos:563

Erdős problem 563

declared provederdos:565

Erdős problem 565

declared openerdos:568

Erdős problem 568

declared openerdos:569

Erdős problem 569

declared provederdos:570

Erdős problem 570

declared openerdos:571

Erdős problem 571

graph theoryturan numberN/A

declared openerdos:572

Erdős problem 572

graph theoryturan numberpossible

declared openerdos:573

Erdős problem 573

graph theoryturan numberA006856

declared disprovederdos:574

Erdős problem 574

graph theoryturan numberpossible

declared openerdos:575

Erdős problem 575

graph theoryturan numberN/A

declared openerdos:576

Erdős problem 576

graph theoryturan numberpossible

declared provederdos:577

Erdős problem 577

declared provederdos:578

Erdős problem 578

declared decidableerdos:580

Erdős problem 580

declared solvederdos:581

Erdős problem 581

graph theorypossible

declared falsifiableerdos:583

Erdős problem 583