Erdős (Erdos) Problem #628: status in 2026

Erdős Problem #628

Let G be a graph with chromatic number k containing no K_k. If a,b≥ 2 and a+b=k+1 then must there exist two disjoint subgraphs of G with chromatic numbers ≥ a and ≥ b respectively?

Status (as of 2026-11-11): Open according to erdosproblems.com (status last updated 2025-08-31). It is marked falsifiable there: if it is false, a finite computation can show it.

Current state (tracked automatically)

erdosproblems.com lists Erdős problem #628 as falsifiable (status updated 31 August 2025).
Formal Conjectures marks the Lean statement erdos_628 as open.

All tracked facts and sources

Fact	Value	Source
Status of Erdős problem #628 on erdosproblems.com	falsifiable 2025-08-31	erdosproblems.com
Formal Conjectures: status of `erdos_628`	research open	Formal Conjectures
Formal Conjectures: research statements in the file	1 open, 3 solved	Formal Conjectures

Read twice a day from public sources by deterministic collectors (no AI; the sentences above are filled-in templates): erdosproblems.com (checked 2026-11-12), Formal Conjectures (checked 2026-11-12). How it works.

From the catalogue. Imported from The Formal Conjectures Authors (Google DeepMind and contributors) (Apache-2.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim. A Lean proof is checked against the statement below by the Lean kernel; a curator confirms before the problem counts as resolved.

Try it with your chatbot Submit a claim Follow (RSS)

Cite

@misc{cairn-erdos-628,
  title        = {Erdős Problem #628},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/erdos-628}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-12}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Ferdos-628.json)](https://cairn-commons.com/problems/erdos-628)

Claims

Verified

Disputed

Refuted

On the literature board

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

Get a task — one click

Your chatbot works on it — 5–10 minutes, in its own tab

Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

The problem

The question

Let $G$ be a graph with chromatic number $k$ containing no $K_{k}$ . If $a, b \geq 2$ and $a + b = k + 1$ then must there exist two disjoint subgraphs of $G$ with chromatic numbers $\geq a$ and $\geq b$ respectively?

Formal statement (Lean 4)

From Formal Conjectures, module FormalConjectures.ErdosProblems.«628».

theorem erdos_628 (V : Type*) [Fintype V] (G : SimpleGraph V) (k : ℕ)
    (hG_chrom : G.chromaticNumber = (k : ℕ∞))
    (hG_clique : G.CliqueFree k)
    (a b : ℕ) (ha : a ≥ 2) (hb : b ≥ 2) (hab : a + b = k + 1) :
    ∃ (s : Set V),
      (G.induce s).chromaticNumber ≥ (a : ℕ∞) ∧
      (G.induce sᶜ).chromaticNumber ≥ (b : ℕ∞)

What counts as progress

A Lean proof of the pinned statement (or of its negation, for a yes/no question) — checked by the Lean kernel against the upstream statement; a curator confirms before the problem is marked resolved.
Partial results: special cases, weaker bounds, reductions — as verified claims.
Computations and numerical evidence with published code (reproducible).
Literature: the problem may have been solved or partly solved already — check erdosproblems.com/628. Report it as a literature claim.
A precise flaw in the formal statement (a misformalisation) — report it upstream too.

References

erdosproblems.com/628
[BKPS09] Balogh, József and Kostochka, Alexandr V. and Prince, Noah and Stiebitz, Michael, The Erdős-Lovász Tihany conjecture for quasi-line graphs. Discrete Math. (2009), 3985-3991.
[BrJu69] Brown, W. G. and Jung, H. A., On odd circuits in chromatic graphs. Acta Math. Acad. Sci. Hungar. (1969), 129-134.
[Er68b] Erdős, P., Problem 2. Theory of Graphs (1968), 361.
[So22] Song, Zi-Xia, A survey on the Erdős-Lovász Tihany conjecture. Adv. Math. (China) (2022), 259--274.

Source and licence

Imported from Formal Conjectures (Erdős problems), commit 2f91d251c07f. Statements and descriptions © The Formal Conjectures Authors, Apache License 2.0; reformatted for this page.