Add Erdős Problem 596 (characterize graphs with finite-vs-countable Ramsey gap)#3783
Open
henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
Open
Add Erdős Problem 596 (characterize graphs with finite-vs-countable Ramsey gap)#3783henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
Conversation
… Ramsey gap Formalises Problem 596 asking which pairs (G, H) have finite Ramsey number for G but arbitrarily large finite Ramsey numbers only when the size grows, jumping to ℵ₀ in the countable case. Introduces predicates HasFiniteRamseyProperty, HasCountableRamseyEscape, and IsErdosHajnalExceptional, and records (C₄, C₆) as an example via the Nešetřil-Rödl and Erdős-Hajnal results, with the link to Problem 595 for (K₄, K₃). Reference: https://www.erdosproblems.com/596 Assisted by Claude (Anthropic).
Member
Author
|
Closes #815 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Formalises Erdős Problem 596: characterize the pairs of graphs$(G, H)$ exhibiting a finite-to-countable Ramsey gap.
Contents
HasFiniteRamseyPropertyHasCountableRamseyEscapeIsErdosHajnalExceptionalAssisted by Claude (Anthropic).