Add Erdős Problem 111 (bipartite edge deletion for uncountable chromatic graphs)#3785
Open
henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
Open
Add Erdős Problem 111 (bipartite edge deletion for uncountable chromatic graphs)#3785henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
henrykmichalewski wants to merge 1 commit intogoogle-deepmind:mainfrom
Conversation
…matic graphs Formalises Problem 111 on how many edges must be deleted from an uncountably chromatic graph to make it bipartite, in terms of the function h_G(n). Adds definitions bipartiteDistance and hG, the main open theorem about h_G(n)/n → ∞, the Erdős-Hajnal-Szemerédi lower and upper bound variants, and records Erdős's conjectured sharper bound. Reference: https://www.erdosproblems.com/111 Assisted by Claude (Anthropic).
Member
Author
|
Closes #341 |
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 111: for a graph$G$ with $\chi(G) = \aleph_1$ , study the function $h_G(n)$ measuring the minimum edges that must be deleted from a subgraph of order $n$ to render it bipartite.
Contents
bipartiteDistance(the minimum number of edges to delete to reach a bipartite graph) andhG.Assisted by Claude (Anthropic).