feat(Combinatorics/SimpleGraph): prove the minimal-degree version of the Erdős-Stone theorem#28685
Open
mitchell-horner wants to merge 63 commits intoleanprover-community:masterfrom
Open
feat(Combinatorics/SimpleGraph): prove the minimal-degree version of the Erdős-Stone theorem#28685mitchell-horner wants to merge 63 commits intoleanprover-community:masterfrom
mitchell-horner wants to merge 63 commits intoleanprover-community:masterfrom
Conversation
1 task
PR summary 02398f3984Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
Collaborator
|
This pull request has conflicts, please merge |
Closed
2 tasks
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
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.
Proves the minimal degree-version of the Erdős-Stone theorem:
If
Ghas a minimal degree of at least(1 - 1 / r + o(1)) * card V, thenGcontains a copy of acompleteEquipartiteGraphinr + 1parts each of sizet.The double-counting construction from the proof is available in
namespace ErdosStone.betweensubgraphs #25843completeEquipartiteGraph#27597CompleteEquipartiteSubgraph#27599filter_disjiUnion#28443one_sub_one_div_cast_*theorems #28445card_edgeFinset_map#28446This is the first of several pull requests towards the full Erdős-Stone(-Simonovits) theorem, hence the name of the file.