-
Notifications
You must be signed in to change notification settings - Fork 386
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/SimpleGraph): define Copy #20658
Conversation
messageFile.md |
Co-authored-by: Bhavik Mehta <[email protected]>
messageFile.md |
Can you merge master? This will fix the bot |
@mitchell-horner can you merge master and resolve all comments which you have dealt with? |
PR summary ea7425d09eImport changes for modified filesNo significant changes to the import graph Import changes for all files
|
@kbuzzard I've been waiting for others' input on the name |
I still think |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks!
maintainer delegate
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
Thanks! bors d+ |
✌️ mitchell-horner can now approve this pull request. To approve and merge a pull request, simply reply with |
bors r+ |
Define the type `Copy` as the subtype of injective homomorphisms. Also define - the predicate that a simple graph contains another simple graph `IsContained` (equivalent to "is isomorphic to a subgraph of"), - the predicate that a simple graph is free of another simple graph `Free` for convenience.
Pull request successfully merged into master. Build succeeded: |
Define the type
Copy
as the subtype of injective homomorphisms.Also define
IsContained
(equivalent to "is isomorphic to a subgraph of"),Free
for convenience.