Skip to content

Problems · Vela Mathematics Program

Narrowed todisproved ×graph theory ×Clear all

Problem ledger

24 problemsGraph view
declared disprovederdos:59
Erdős problem 59
graph theoryturan numberN/A
declared disprovederdos:110
Erdős problem 110
graph theorychromatic numbercyclesN/A
declared disproved · $500erdos:113
Erdős problem 113
graph theoryturan numberN/A
declared disprovederdos:133
Erdős problem 133
graph theorypossible
declared disproved · $500erdos:147
Erdős problem 147
graph theoryturan numberN/A
declared disproved · formalizederdos:533
False ↔ ∀ (δ : ℝ), 0 < δ → ∃ c, 0 < c ∧ ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (G : SimpleGraph (Fin n)), G.CliqueFree 5 → δ * ↑n ^ 2 ≤ ↑G.edgeFinset.card → ∃ S, c * ↑n ≤ ↑S.card ∧ G.CliqueFreeOn (↑S) 3
graph theoryN/A3 sources
declared disprovederdos:549
Erdős problem 549
graph theoryramsey theoryN/A
declared disprovederdos:559
Erdős problem 559
graph theoryramsey theorypossible
declared disprovederdos:574
Erdős problem 574
graph theoryturan numberpossible
declared disproved · formalizederdos:615
False ↔ ∃ c, 0 < c ∧ ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (G : SimpleGraph (Fin n)), (1 / 8 - c) * ↑n ^ 2 ≤ ↑G.edgeFinset.card → ¬G.CliqueFree 4 ∨ ↑n / Real.log ↑n ≤ ↑G.indepNum
graph theoryramsey theorypossible2 sources
declared disprovederdos:632
Erdős problem 632
graph theorychromatic numberN/A
declared disprovederdos:641
Erdős problem 641
graph theoryN/A
declared disproved · formalizederdos:705
False ↔ ∃ k, ∀ (V : Set (EuclideanSpace ℝ (Fin 2))), V.Finite → (SimpleGraph.UnitDistancePlaneGraph V).girth ≥ k → (SimpleGraph.UnitDistancePlaneGraph V).chromaticNumber ≤ 3
graph theorychromatic numberN/A3 sources
declared disprovederdos:744
Erdős problem 744
graph theorychromatic numberpossible
declared disprovederdos:803
Erdős problem 803
graph theoryN/A
declared disprovederdos:804
Erdős problem 804
graph theorypossible
declared disprovederdos:807
Erdős problem 807
graph theoryN/A
declared disprovederdos:808
Erdős problem 808
additive combinatoricsgraph theoryN/A
declared disprovederdos:815
Erdős problem 815
graph theoryN/A
declared disprovederdos:832
Erdős problem 832
graph theoryhypergraphschromatic numberpossible
declared disprovederdos:925
Erdős problem 925
graph theoryramsey theorypossible
declared disprovederdos:1006
Erdős problem 1006
graph theorycyclesN/A
declared disproved · formalizederdos:1077
False ↔ ∀ ε > 0, ε < 1 → ∀ α > 0, α < 1 → ∀ᶠ (D : ℝ) in Filter.atTop, ∀ᶠ (n : ℕ) in Filter.atTop, ∀ (G : SimpleGraph (Fin n)), ↑G.edgeSet.ncard > ↑n ^ (1 + α) → ∃ H, H.coe.IsBalanced D ∧ ↑H.verts.ncard > ↑n ^ (1 - α) ∧ ↑H.edgeSet.ncard > ε * ↑H.verts.ncard ^ (1 + α)
graph theoryN/A2 sources
declared disprovederdos:1216
Erdős problem 1216
graph theoryramsey theorypossible

Search problems.science

Find a Problem, Result, source, or page