FormalConjectures.ErdosProblems.«550»

/-
Copyright 2026 The Formal Conjectures Authors.

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    https://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/

import FormalConjecturesUtil

Erdős Problem 550

References:

erdosproblems.com/550

[Ch77] Chvátal, V., Tree-complete graph Ramsey numbers. J. Graph Theory (1977), 93.

open Filternamespace Erdos550

Let $m_1\leq\cdots\leq m_k$ and $n$ be sufficiently large. If $T$ is a tree on $n$ vertices and $G$ is the complete multipartite graph with vertex class sizes $m_1,\ldots,m_k$ then prove that $$R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1.$$

This problem is #16 in Ramsey Theory in the graphs problem collection.

@[category research open, AMS 5]
theorem erdos_550 :
    ∀ (k : ℕ) (hk : 2 ≤ k) (m : Fin k → ℕ) (hm : Monotone m)
      (hm_pos : ∀ i, 0 < m i),
      ∀ᶠ n : ℕ in atTop,
        ∀ (T : SimpleGraph (Fin n)), T.IsTree →
          SimpleGraph.graphRamsey T
            (SimpleGraph.completeMultipartiteGraph (fun i ↦ Fin (m i))) ≤
            (k - 1) * (SimpleGraph.graphRamsey T
              (completeBipartiteGraph (Fin (m ⟨0, byk:ℕhk:2 ≤ km:Fin k → ℕhm:Monotone mhm_pos:∀ (i : Fin k), 0 < m in:ℕT:SimpleGraph (Fin n)⊢ 0 < k omegaAll goals completed! 🐙⟩)) (Fin (m ⟨1, byk:ℕhk:2 ≤ km:Fin k → ℕhm:Monotone mhm_pos:∀ (i : Fin k), 0 < m in:ℕT:SimpleGraph (Fin n)⊢ 1 < k omegaAll goals completed! 🐙⟩))) - 1) +
                m ⟨0, byk:ℕhk:2 ≤ km:Fin k → ℕhm:Monotone mhm_pos:∀ (i : Fin k), 0 < m in:ℕT:SimpleGraph (Fin n)⊢ 0 < k omegaAll goals completed! 🐙⟩ := by⊢ ∀ (k : ℕ) (hk : 2 ≤ k) (m : Fin k → ℕ),
  Monotone m →
    (∀ (i : Fin k), 0 < m i) →
      ∀ᶠ (n : ℕ) in atTop,
        ∀ (T : SimpleGraph (Fin n)),
          T.IsTree →
            T.graphRamsey (SimpleGraph.completeMultipartiteGraph fun i ↦ Fin (m i)) ≤
              (k - 1) * (T.graphRamsey (completeBipartiteGraph (Fin (m ⟨0, ⋯⟩)) (Fin (m ⟨1, ⋯⟩))) - 1) + m ⟨0, ⋯⟩
  sorryAll goals completed! 🐙

-- TODO: Add variants of the problem.

end Erdos550