Skip to content

feat: formalize Erdős Problem 742 (Murty-Simon Conjecture) #2200

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.

Sign up for GitHub

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

Jump to bottom
Open
yurekami wants to merge 1 commit into
base: main
Choose a base branch
from
Open

feat: formalize Erdős Problem 742 (Murty-Simon Conjecture) #2200

yurekami wants to merge 1 commit into from

Conversation

@yurekami
Copy link
Contributor

@yurekami yurekami commented Feb 7, 2026

Summary

  • Formalizes the Murty-Simon Conjecture (Erdős Problem 742): every diameter-2-critical graph on $n$ vertices has at most $\lfloor n^2/4 \rfloor$ edges.
  • Defines hasDiameterAtMostTwo and isDiameterTwoCritical for SimpleGraph.

Closes #2132

Split from #2197 per reviewer request.

@yurekami
feat: formalize Erdős Problem 742 (Murty-Simon Conjecture)
8f5bf29 
Formalize the Murty-Simon Conjecture: every diameter-2-critical graph
on n vertices has at most ⌊n²/4⌋ edges.

Closes google-deepmind#2132
@github-actions github-actions bot added the erdos-problems Erdős Problems label Feb 7, 2026
@yurekami yurekami mentioned this pull request Feb 7, 2026
Closed
4 tasks
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Reviewers

No reviews

Assignees

No one assigned

Labels

erdos-problems Erdős Problems

Projects

None yet

Milestone

No milestone

Development

Successfully merging this pull request may close these issues.

Erdős Problem 742: Edge bounds for diameter-2-critical graphs; Murty-Simon Conjecture

1 participant

@yurekami