Skip to content

Add Erdős Problem 595 (K₄-free graph not union of triangle-free, $250 prize)#3775

Open
henrykmichalewski wants to merge 2 commits intogoogle-deepmind:mainfrom
henrykmichalewski:add-problem-595
Open

Add Erdős Problem 595 (K₄-free graph not union of triangle-free, $250 prize)#3775
henrykmichalewski wants to merge 2 commits intogoogle-deepmind:mainfrom
henrykmichalewski:add-problem-595

Conversation

@henrykmichalewski
Copy link
Copy Markdown
Member

@henrykmichalewski henrykmichalewski commented Apr 16, 2026

fixes #814

Problem

Erdős Problem 595: https://www.erdosproblems.com/595 ($250 prize)

Does there exist a K₄-free graph of chromatic number ℵ₁ which cannot be written as a countable union of triangle-free subgraphs?

Contents

  • IsCountableUnionOfTriangleFree definition for SimpleGraph
  • Main open theorem erdos_595
  • Folkman/Nešetřil-Rödl finite version variant
  • Edge-colouring reformulation
  • 4 fully proved lemmas (empty graph is countable union, triangle-free implies countable union, finite clique-free graphs, monotonicity)

Assisted by Claude (Anthropic).

…e-free ($250 prize)

Adds formalization of Erdős Problem 595 (Erdős-Hajnal, $250 prize).
Reference: https://www.erdosproblems.com/595

Asks whether there exists a K₄-free graph of chromatic number ℵ₁ which
cannot be written as a countable union of triangle-free subgraphs. Includes
IsCountableUnionOfTriangleFree definition, Folkman/Nešetřil-Rödl finite
version, 4 proved lemmas, and edge-colouring reformulation. Assisted by
Claude (Anthropic).
@github-actions github-actions bot added the erdos-problems Erdős Problems label Apr 16, 2026
@henrykmichalewski
Copy link
Copy Markdown
Member Author

Closes #814

Copy link
Copy Markdown
Collaborator

@mo271 mo271 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks! Looks good to me and mathemtically correct, just some small suggestions...

@@ -0,0 +1,264 @@
/-
Copyright 2025 The Formal Conjectures Authors.
Copy link
Copy Markdown
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Suggested change
Copyright 2025 The Formal Conjectures Authors.
Copyright 2026 The Formal Conjectures Authors.

Comment thread FormalConjectures/ErdosProblems/595.lean
Comment thread FormalConjectures/ErdosProblems/595.lean Outdated
Comment thread FormalConjectures/ErdosProblems/595.lean Outdated
Copy link
Copy Markdown
Collaborator

@mo271 mo271 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Thanks, LGTM!

@mo271
Copy link
Copy Markdown
Collaborator

mo271 commented Apr 17, 2026

CLA bot is not happy -- should be fixed by rewriting history, removing authors that have not signed the CLA by amending the commit(s)...

…e_colouring

- Update copyright year to 2026
- Remove duplicate docstring on IsCountableUnionOfTriangleFree def
- Update reformulation_edge_colouring docstring to reference c : G.edgeSet → ℕ
- Change attribute to @[category test, AMS 5]
- Prove reformulation_edge_colouring using EdgeLabeling.iSup_labelGraph and Sym2.ind

Assisted by Claude (Anthropic).
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

erdos-problems Erdős Problems

Projects

None yet

Development

Successfully merging this pull request may close these issues.

Erdős Problem 595

2 participants