Skip to content

Add Erdős Problem 111 (bipartite edge deletion for uncountable chromatic graphs) #3785

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
henrykmichalewski wants to merge 4 commits into
base: main
Choose a base branch
from
+144 −0

fix(ErdosProblems/111): use ≥ ℵ_1 in erdos_conjecture variant + clari…

24ca0f9
Select commit
Loading
Failed to load commit list.
Open

Add Erdős Problem 111 (bipartite edge deletion for uncountable chromatic graphs) #3785

fix(ErdosProblems/111): use ≥ ℵ_1 in erdos_conjecture variant + clari…
24ca0f9
Select commit
Loading
Failed to load commit list.
Google CLA / cla/google succeeded May 12, 2026 in 14s

✅ All contributors are covered under a CLA with Google

See https://cla.developers.google.com/ for more info about Google's Contributor License Agreement (CLA).

ℹ️ Googlers: Go here to view more details and manage scans for this pull request.

Details

The following contributors were found for this pull request:

✅ 24ca0f9 Author: @henrykmichalewski <henr*********wski​@gmail.com>

(Only the first commit for a unique contributor is listed.)

View more details on Google CLA