feat(Combinatorics/SimpleGraph): hamiltonians graphs don't contain bridges#36802
feat(Combinatorics/SimpleGraph): hamiltonians graphs don't contain bridges#36802YaelDillies wants to merge 3 commits intoleanprover-community:masterfrom
Conversation
…t in `Walk.rotate` It is annoying for it not to appear in the infoview. In general, no implicit data argument to a definition should be inferrable only through proof arguments.
…bridge Replace the longer proof which assumed that the vertex set has at least three elements.
PR summary 2352820370Import changes exceeding 2%
|
| File | Base Count | Head Count | Change |
|---|---|---|---|
| Mathlib.Combinatorics.SimpleGraph.Hamiltonian | 594 | 772 | +178 (+29.97%) |
Import changes for all files
| Files | Import difference |
|---|---|
Mathlib.Combinatorics.SimpleGraph.Hamiltonian |
178 |
Declarations diff
+ IsBridge.nontrivial
+ IsBridge.not_isHamiltonian
+ IsCircuit.of_rotate
+ IsCycle.of_rotate
+ IsHamiltonian.exists_isHamiltonianCycle
+ IsHamiltonian.finite
+ IsHamiltonianCycle.finite
+ IsHamiltonianCycle.of_rotate
+ IsHamiltonianCycle.rotate
+ IsTrail.isEdgeReachable_two
+ IsTrail.isEdgeReachable_two_of_isEdgeReachable_two
+ IsTrail.isEdgeReachable_two_of_isEdgeReachable_two_aux
+ IsTrail.of_rotate
+ isCircuit_rotate
+ isCycle_rotate
+ isHamiltonianCycle_rotate
+ isTrail_rotate
+ length_rotate
+ not_isHamiltonianCycle_of_infinite
+ not_isHamiltonian_of_infinite
+ rotate_eq_nil
- IsTrail.not_mem_edges_of_not_isEdgeReachable_two
- not_isHamiltonian_of_isBridge
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
relativevalue is the weighted sum of the differences with weight given by the inverse of the current value of the statistic. - The
absolutevalue is therelativevalue divided by the total sum of the inverses of the current values (i.e. the weighted average of the differences).
|
This PR/issue depends on: |
Replace the longer proof which assumed that the vertex set has at least three elements.
Walk.rotate#36800