Add Erdős Problem 1175 (triangle-free subgraph of uncountable chromatic graph)#3786
Open
henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
Open
Add Erdős Problem 1175 (triangle-free subgraph of uncountable chromatic graph)#3786henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
Conversation
…atic graph Formalises Problem 1175 asking whether every graph of uncountable chromatic number has a triangle-free subgraph of uncountable chromatic number. Uses chromaticCardinal from upstream, and records Shelah's consistency result for the negative direction when κ=λ=ℵ₁ together with a threshold reformulation. Reference: https://www.erdosproblems.com/1175 Assisted by Claude (Anthropic).
Member
Author
|
Closes #1998 |
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 1175: does every graph of uncountable chromatic number contain a triangle-free subgraph of uncountable chromatic number?
Contents
chromaticCardinalfrom upstream.Assisted by Claude (Anthropic).