Theorems · Theorem · combinatorics
SimpleGraph.Subgraph.IsPerfectMatching.symmDiff_isCycles
∀ {V : Type u_1} {G G' : SimpleGraph V} {M : G.Subgraph} {M' : G'.Subgraph},
M.IsPerfectMatching → M'.IsPerfectMatching → (symmDiff M.spanningCoe M'.spanningCoe).IsCycles- Cited by
- 0 results in Mathlib
- Foundations
- Depth 103 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- SimpleGraphstatement and proof · cited by 3,072
- Set.Nonemptyproof · cited by 2,627
- Set.extproof · cited by 2,266
- SimpleGraph.Subgraphstatement and proof · cited by 326
- SimpleGraph.neighborSetproof · cited by 257
- symmDiffstatement · cited by 236
- SimpleGraph.Subgraph.Adjproof · cited by 147
- SimpleGraph.Subgraph.spanningCoestatement and proof · cited by 33
- SimpleGraph.Subgraph.IsPerfectMatchingstatement and proof · cited by 18
- SimpleGraph.IsCyclesstatement · cited by 12
- SimpleGraph.Subgraph.spanningCoe_adjproof · cited by 8
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.