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: Girth of a simple graph #6948
Closed
Closed
Conversation
This file contains 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
and corresponding lemmas for `ℕ∞`. Also fix implicitness of `iff` lemmas.
Define the girth of a simple graph as a `ℕ∞`.
YaelDillies
added
blocked-by-other-PR
This PR depends on another PR which is still in the queue.
awaiting-review
The author would like community review of the PR
t-combinatorics
Combinatorics
labels
Sep 4, 2023
jcommelin
added
awaiting-author
A reviewer has asked the author a question or requested changes
and removed
awaiting-review
The author would like community review of the PR
labels
Sep 4, 2023
leanprover-community-mathlib4-bot
removed
the
blocked-by-other-PR
This PR depends on another PR which is still in the queue.
label
Sep 4, 2023
This PR/issue depends on:
|
YaelDillies
added
awaiting-review
The author would like community review of the PR
and removed
awaiting-author
A reviewer has asked the author a question or requested changes
labels
Sep 4, 2023
Thanks 🎉 bors merge |
github-actions
bot
added
ready-to-merge
This PR has been sent to bors.
and removed
awaiting-review
The author would like community review of the PR
labels
Sep 4, 2023
bors bot
pushed a commit
that referenced
this pull request
Sep 4, 2023
Define the girth of a simple graph as a `ℕ∞`.
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. If you want to switch to GitHub's built-in merge queue, visit their help page. |
bors
bot
changed the title
feat: Girth of a simple graph
[Merged by Bors] - feat: Girth of a simple graph
Sep 4, 2023
ebab
pushed a commit
that referenced
this pull request
Sep 6, 2023
Define the girth of a simple graph as a `ℕ∞`.
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.
Define the girth of a simple graph as a
ℕ∞
.WithTop
lemmas #6947This is not much API, but the goal is to be able to state the chromatic-girth theorem in case a LFTCM attendee wants to formalise it. cc @RemyDegenne