[Merged by Bors] - feat(Combinatorics/SimpleGraph/Finite): min/max degrees of top/bot#35627
Conversation
PR summary de4f458186Import changes for modified filesNo significant changes to the import graph Import changes for all files
|
| · obtain ⟨_, hv⟩ := G.exists_maximal_degree_vertex | ||
| exact hv ▸ h _ | ||
|
|
||
| theorem IsRegularOfDegree.maxDegree_eq [Nonempty V] [DecidableRel G.Adj] {d : ℕ} |
There was a problem hiding this comment.
I was going to suggest eliminating Nonempty V here, and then I realized G is regular of all degrees for IsEmpty V, gross.
There was a problem hiding this comment.
Just had the thought that really what you're proving shows the correct definition, G.maxDegree = G.minDegree thought this has the unfortunate side effect of not working with locally finite graphs of unbounded degree (e.g. the type class assumption G.LocallyFinite would have to be weakened to Fintype V in the definition of IsRegularOfDegree.)
There was a problem hiding this comment.
Yes, but unfortunately my #33501 hasn't gathered support. I'd love to avoid Fintype everywhere in the degree API.
There was a problem hiding this comment.
The objection in that review seems to be to changing degree to work for infinite graphs, but if I understand correctly the objection was not to either 1) changing Fintype to Finite and 2) or defining edegree and friends. So we could still have maxEDegree/minEDegree for this definition.
There was a problem hiding this comment.
Bhavik did object to (1), but (2) is still on the table. I'm planning to do (2).
YaelDillies
left a comment
There was a problem hiding this comment.
Thanks!
maintainer delegate
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
|
@jcommelin Hey, can you clarify why this is no longer considered maintainer merged? |
YaelDillies
left a comment
There was a problem hiding this comment.
Thanks! 🚀
maintainer merge
|
🚀 Pull request has been placed on the maintainer queue by YaelDillies. |
…35627) And a couple of lemmas about `IsRegularOfDegree`, e.g. the empty graph is regular of any degree.
|
Pull request successfully merged into master. Build succeeded: |
…eanprover-community#35627) And a couple of lemmas about `IsRegularOfDegree`, e.g. the empty graph is regular of any degree.
And a couple of lemmas about
IsRegularOfDegree, e.g. the empty graph is regular of any degree.