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/basic): introduce incidence sets, graph construction from relation #5191

Closed
wants to merge 30 commits into from

Conversation

agusakov
Copy link
Collaborator

@agusakov agusakov commented Dec 2, 2020

Add incidence sets and some lemmas, including a proof of equivalence between the neighbor set of a vertex and its incidence set. Add a graph construction from a given relation.

Definitions and lemmas adapted from simple_graphs2


@agusakov agusakov changed the title feat(combinatorics/simple_graph/basic): introduce incidence sets and lemmas feat(combinatorics/simple_graph/basic): introduce incidence sets, graph construction from relation Dec 2, 2020
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
@agusakov agusakov added the awaiting-review The author would like community review of the PR label Dec 2, 2020
@agusakov agusakov removed the request for review from jalex-stark December 2, 2020 20:26
@awainverse
Copy link
Collaborator

This looks great to me, except I note that finish and tidy are used more often than I would default to. Is this running at a reasonable speed?

agusakov and others added 3 commits December 2, 2020 16:24
@agusakov
Copy link
Collaborator Author

agusakov commented Dec 2, 2020

I think the speed is reasonable, it only takes a few seconds at worst for proofs to work

@bryangingechen
Copy link
Collaborator

I think the speed is reasonable, it only takes a few seconds at worst for proofs to work

Keep in mind that mathlib has 40k+ theorems, so a few seconds for a proof is actually on the slower side of things.

agusakov and others added 5 commits December 3, 2020 17:07
Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
Co-authored-by: Eric Wieser <wieser.eric@gmail.com>
@agusakov
Copy link
Collaborator Author

agusakov commented Dec 5, 2020

Is there anything else I should do here?

Copy link
Collaborator

@kmill kmill left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Copy link
Collaborator

@bryangingechen bryangingechen left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Otherwise LGTM. Thanks!
bors d+

src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
src/combinatorics/simple_graph/basic.lean Outdated Show resolved Hide resolved
@bors
Copy link

bors bot commented Dec 6, 2020

✌️ agusakov can now approve this pull request. To approve and merge a pull request, simply reply with bors r+. More detailed instructions are available here.

@bryangingechen bryangingechen added awaiting-author A reviewer has asked the author a question or requested changes delegated The PR author may merge after reviewing final suggestions. and removed awaiting-review The author would like community review of the PR labels Dec 6, 2020
agusakov and others added 3 commits December 6, 2020 13:47
Co-authored-by: Bryan Gin-ge Chen <bryangingechen@gmail.com>
Co-authored-by: Bryan Gin-ge Chen <bryangingechen@gmail.com>
Co-authored-by: Bryan Gin-ge Chen <bryangingechen@gmail.com>
@agusakov
Copy link
Collaborator Author

agusakov commented Dec 6, 2020

bors r+

bors bot pushed a commit that referenced this pull request Dec 6, 2020
…ph construction from relation (#5191)

Add incidence sets and some lemmas, including a proof of equivalence between the neighbor set of a vertex and its incidence set. Add a graph construction from a given relation.

Definitions and lemmas adapted from [simple_graphs2](https://github.com/leanprover-community/mathlib/blob/simple_graphs2/src/combinatorics/simple_graph/basic.lean#L317)



Co-authored-by: agusakov <39916842+agusakov@users.noreply.github.com>
@bors
Copy link

bors bot commented Dec 6, 2020

Build failed:

@agusakov
Copy link
Collaborator Author

agusakov commented Dec 6, 2020

bors r+

bors bot pushed a commit that referenced this pull request Dec 6, 2020
…ph construction from relation (#5191)

Add incidence sets and some lemmas, including a proof of equivalence between the neighbor set of a vertex and its incidence set. Add a graph construction from a given relation.

Definitions and lemmas adapted from [simple_graphs2](https://github.com/leanprover-community/mathlib/blob/simple_graphs2/src/combinatorics/simple_graph/basic.lean#L317)



Co-authored-by: agusakov <39916842+agusakov@users.noreply.github.com>
@bors
Copy link

bors bot commented Dec 6, 2020

Pull request successfully merged into master.

Build succeeded:

@bors bors bot changed the title feat(combinatorics/simple_graph/basic): introduce incidence sets, graph construction from relation [Merged by Bors] - feat(combinatorics/simple_graph/basic): introduce incidence sets, graph construction from relation Dec 6, 2020
@bors bors bot closed this Dec 6, 2020
@bors bors bot deleted the simple_graphs3 branch December 6, 2020 20:08
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
awaiting-author A reviewer has asked the author a question or requested changes delegated The PR author may merge after reviewing final suggestions.
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

6 participants