feat(Combinatorics/SimpleGraph/Coloring): add lemmas about coloring and maps#37598
feat(Combinatorics/SimpleGraph/Coloring): add lemmas about coloring and maps#37598IvanRenison wants to merge 5 commits intoleanprover-community:masterfrom
Conversation
PR summary 6a7332dd00Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
|
✌️ IvanRenison can now approve this pull request. To approve and merge a pull request, simply reply with |
|
bors d- Since Snir's suggestions are wise |
|
🚫 All delegations have been removed from this PR. To re-add a delegation, reply with |
| /-- Equivalence of homomorphisms induced by isomorphisms of graphs. -/ | ||
| def homCongr (f' : G'' ≃g G''') : G →g G'' ≃ G' →g G''' := RelIso.relHomCongr f f' |
There was a problem hiding this comment.
I'm not sure if having this is a good idea, or if we should use the RelIso version directly. What do you think?
Idea from this Zulip thread: graph theory>Second Order Monadic Logic for Graph