Skip to content

Erdős problem 599

Erdős Problem 599 (the Erdős–Menger conjecture).

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/599.lean

Formal Conjectures

FormalConjectures/ErdosProblems/599.leanErdos599.erdos_59913 linesExact file
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 iA) ∧              (∀ (i : ι), b iB) ∧                (∀ (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, vSv ∈ (p i).support) ∧a'A, ∀ b'B, ∀ (q : G.Walk a' b'), q.IsPath → ∃ vq.support, vS
SolvedStatement only, no proof

Continue

Search problems.science

Find a Problem, Result, source, or page