Problems · Vela Mathematics Program

declared provederdos:76

Erdős problem 76

graph theoryramsey theoryA060407

declared provederdos:79

Erdős problem 79

declared proved · $100erdos:88

Erdős problem 88

declared provederdos:127

Erdős problem 127

graph theorypossible

declared provederdos:163

Erdős problem 163

declared proved · $250erdos:166

Erdős problem 166

graph theoryramsey theoryA059442

declared provederdos:182

Erdős problem 182

graph theorypossible

declared provederdos:518

Erdős problem 518

declared provederdos:546

Erdős problem 546

graph theoryramsey theorypossible

declared provederdos:553

Erdős problem 553

graph theoryramsey theoryA000791 · possible

declared provederdos:565

Erdős problem 565

graph theoryramsey theorypossible

declared provederdos:570

Erdős problem 570

declared provederdos:577

Erdős problem 577

declared provederdos:578

Erdős problem 578

True ↔ ∀ (V : Type) (G : SimpleGraph V), IsEmpty (G.Coloring ℕ) → ∃ N, ∀ (k : ℕ), N ≤ k → ∃ v w, w.IsCycle ∧ w.length = 2 * k + 1

declared proved · formalizederdos:594

graph theoryset theoryN/A2 sources

declared proved · formalizederdos:599

True ↔ ∀ (V : Type) (G : SimpleGraph V) (A B : Set V), Disjoint A B → G.IsIndepSet A → G.IsIndepSet B → ∃ ι a b p S, (∀ (i : ι), a i ∈ A) ∧ (∀ (i : ι), b i ∈ B) ∧ (∀ (i : ι), (p i).IsPath) ∧ (Pairwise fun i j => Disjoint {v | v ∈ (p i).support} {v | v ∈ (p j).support}) ∧ S ⊆ {v | ∃ i, v ∈ (p i).support} ∧ (∀ (i : ι), ∃! v, v ∈ S ∧ v ∈ (p i).support) ∧ ∀ a' ∈ A, ∀ b' ∈ B, ∀ (q : G.Walk a' b'), q.IsPath → ∃ v ∈ q.support, v ∈ S

graph theoryset theoryN/A2 sources

declared provederdos:622

Erdős problem 622

graph theorypossible

declared provederdos:630

Erdős problem 630

declared provederdos:631

Erdős problem 631

declared provederdos:636

Erdős problem 636

declared provederdos:637

Erdős problem 637

declared provederdos:715

Erdős problem 715

declared provederdos:717

Erdős problem 717

declared provederdos:718

Erdős problem 718

declared proved · $100erdos:720

Erdős problem 720

graph theoryramsey theorypossible

declared provederdos:737

Erdős problem 737

declared provederdos:745

Erdős problem 745

declared provederdos:746

Erdős problem 746

declared provederdos:752

Erdős problem 752

graph theorycyclesN/A

declared provederdos:767

Erdős problem 767

graph theoryturan numberpossible

declared provederdos:797

Erdős problem 797

graph theorychromatic numberpossible

declared provederdos:799

Erdős problem 799

declared provederdos:800

Erdős problem 800

declared provederdos:801

Erdős problem 801

declared provederdos:814

Erdős problem 814

graph theorypossible

declared provederdos:816

Erdős problem 816

declared provederdos:833

Erdős problem 833

graph theoryhypergraphschromatic numberpossible

declared provederdos:842

Erdős problem 842

additive combinatoricsgraph theoryN/A

declared provederdos:895

Erdős problem 895

declared provederdos:900

Erdős problem 900

declared provederdos:916

Erdős problem 916

graph theorycyclesN/A

declared provederdos:921

Erdős problem 921

graph theorychromatic numbercyclespossible

declared provederdos:922

Erdős problem 922

declared provederdos:924

Erdős problem 924