Skip to content

feat(GraphTheory/ExampleSheet1): question 3 - #54

Merged
YaelDillies merged 2 commits into
YaelDillies:masterfrom
n33levo:nsarkar/prove-equal-vertex-degrees
Sep 2, 2026
Merged

feat(GraphTheory/ExampleSheet1): question 3#54
YaelDillies merged 2 commits into
YaelDillies:masterfrom
n33levo:nsarkar/prove-equal-vertex-degrees

Conversation

@n33levo

@n33levo n33levo commented Aug 11, 2026

Copy link
Copy Markdown
Contributor

Question 3's existing signature is false for empty and singleton vertex types. This adds the necessary [Nontrivial α] assumption and proves the stronger result for every finite graph with at least two vertices.

The proof maps each degree into Fin (card α). If this map were injective, equal finite cardinalities would make it surjective, producing both an isolated vertex and a universal vertex. That contradiction yields two distinct vertices with equal degree.

@YaelDillies YaelDillies left a comment

Copy link
Copy Markdown
Owner

Choose a reason for hiding this comment

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

Thank you, but can you merge master?

@n33levo

n33levo commented Sep 2, 2026

Copy link
Copy Markdown
Contributor Author

Thank you, but can you merge master?

should be doable now

@YaelDillies
YaelDillies enabled auto-merge (squash) September 2, 2026 07:09
@YaelDillies
YaelDillies merged commit bc161bb into YaelDillies:master Sep 2, 2026
2 checks passed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants