Skip to content

Add Erdős Problem 596 (characterize graphs with finite-vs-countable Ramsey gap) #3783

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 6 commits into
base: main
Choose a base branch
from

fix(ErdosProblems/596): pairwise disjoint edge colouring + use Mathli…

4adc06f
Select commit
Loading
Failed to load commit list.
Open

Add Erdős Problem 596 (characterize graphs with finite-vs-countable Ramsey gap) #3783

fix(ErdosProblems/596): pairwise disjoint edge colouring + use Mathli…
4adc06f
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:

✅ 4adc06f Author: @henrykmichalewski <henr*********wski​@gmail.com>

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

View more details on Google CLA