Skip to content
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.

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

[Merged by Bors] - feat(combinatorics/simple_graph): Szemerédi's Regularity Lemma #11000

Closed
wants to merge 1 commit into from

Conversation

YaelDillies
Copy link
Collaborator

@YaelDillies YaelDillies commented Dec 23, 2021

Prove (finally!) the equitable version of the Szemerédi Regularity Lemma.

Co-authored-by: Bhavik Mehta bhavikmehta8@gmail.com


This was my second big Lean project, done over the summer 2021 under Bhavik's supervision.

Open in Gitpod

@YaelDillies YaelDillies added WIP Work in progress RFC Request for comment labels Dec 23, 2021
@YaelDillies YaelDillies requested a review from a team as a code owner May 21, 2023 20:20
@YaelDillies YaelDillies changed the title feat(combinatorics/graph/basic): Graph hierarchy using classes feat(combinatorics/simple_graph): Szemerédi's Regularity Lemma May 21, 2023
@YaelDillies YaelDillies added awaiting-review The author would like community review of the PR t-combinatorics Combinatorics and removed WIP Work in progress RFC Request for comment labels May 21, 2023
@YaelDillies YaelDillies added this to In progress in Graph Theory and Combinatorics via automation May 21, 2023
@YaelDillies
Copy link
Collaborator Author

To explain the shuffle: I have hijacked my own PR because it has a nice round number for an important result, and the original material won't make it to mathlib (although @kmill has been working on a Lean 4 substitute). The original content of the PR can be found on branch graph_hierarchy.

@kmill
Copy link
Collaborator

kmill commented May 21, 2023

The PR number having so many 0's absolves you of any GitHub-shuffling indiscretions 😉

Thanks for the big theorem!

bors r+

@github-actions github-actions bot added ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.) and removed awaiting-review The author would like community review of the PR labels May 21, 2023
bors bot pushed a commit that referenced this pull request May 21, 2023
Prove (finally!) the equitable version of the Szemerédi Regularity Lemma.

Co-authored-by: Bhavik Mehta <bhavikmehta8@gmail.com>
@bors
Copy link

bors bot commented May 22, 2023

Pull request successfully merged into master.

Build succeeded!

The publicly hosted instance of bors-ng is deprecated and will go away soon.

If you want to self-host your own instance, instructions are here.
For more help, visit the forum.

If you want to switch to GitHub's built-in merge queue, visit their help page.

@bors bors bot changed the title feat(combinatorics/simple_graph): Szemerédi's Regularity Lemma [Merged by Bors] - feat(combinatorics/simple_graph): Szemerédi's Regularity Lemma May 22, 2023
@bors bors bot closed this May 22, 2023
Graph Theory and Combinatorics automation moved this from In progress to Done May 22, 2023
@bors bors bot deleted the graph_classes branch May 22, 2023 00:02
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
ready-to-merge All that is left is for bors to build and merge this PR. (Remember you need to say `bors r+`.) t-combinatorics Combinatorics
Development

Successfully merging this pull request may close these issues.

None yet

2 participants