Skip to content

feat(SimpleGraph): strongly regular graphs have diameter 2#35655

Open
Rida-Hamadani wants to merge 5 commits intoleanprover-community:masterfrom
Rida-Hamadani:srg/diam_eq_two
Open

feat(SimpleGraph): strongly regular graphs have diameter 2#35655
Rida-Hamadani wants to merge 5 commits intoleanprover-community:masterfrom
Rida-Hamadani:srg/diam_eq_two

Conversation

@Rida-Hamadani
Copy link
Copy Markdown
Collaborator

@Rida-Hamadani Rida-Hamadani commented Feb 22, 2026

A strongly regular graph with positive μ must have diameter 2, as long as the vertex set is nontrivial and it is not complete.


This statement is useful in the literature, I wanted to add it after seeing it being used in the proof of the Hoffman-Singleton theorem.

Open in Gitpod

@github-actions
Copy link
Copy Markdown

github-actions bot commented Feb 22, 2026

PR summary 68e18bf8ed

Import changes for modified files

Dependency changes

File Base Count Head Count Change
Mathlib.Combinatorics.SimpleGraph.StronglyRegular 1126 1131 +5 (+0.44%)
Import changes for all files
Files Import difference
Mathlib.Combinatorics.SimpleGraph.StronglyRegular 5

Declarations diff

+ IsSRGWith.ediam_eq_two

You can run this locally as follows
## summary with just the declaration names:
./scripts/pr_summary/declarations_diff.sh <optional_commit>

## more verbose report:
./scripts/pr_summary/declarations_diff.sh long <optional_commit>

The doc-module for scripts/pr_summary/declarations_diff.sh contains some details about this script.


No changes to technical debt.

You can run this locally as

./scripts/reporting/technical-debt-metrics.sh pr_summary
  • The relative value is the weighted sum of the differences with weight given by the inverse of the current value of the statistic.
  • The absolute value is the relative value divided by the total sum of the inverses of the current values (i.e. the weighted average of the differences).

@mathlib-dependent-issues mathlib-dependent-issues bot added the blocked-by-other-PR This PR depends on another PR (this label is automatically managed by a bot) label Feb 22, 2026
@Rida-Hamadani Rida-Hamadani added the t-combinatorics Combinatorics label Feb 22, 2026
@mathlib-dependent-issues mathlib-dependent-issues bot removed the blocked-by-other-PR This PR depends on another PR (this label is automatically managed by a bot) label Mar 22, 2026
@mathlib-dependent-issues
Copy link
Copy Markdown

@mathlib-merge-conflicts mathlib-merge-conflicts bot added the merge-conflict The PR has a merge conflict with master, and needs manual merging. (this label is managed by a bot) label Mar 22, 2026
@mathlib-merge-conflicts
Copy link
Copy Markdown

This pull request has conflicts, please merge master and resolve them.

@github-actions github-actions bot removed the merge-conflict The PR has a merge conflict with master, and needs manual merging. (this label is managed by a bot) label Mar 22, 2026
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

t-combinatorics Combinatorics

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant