Theorems · Definition · combinatorics
Matroid.delete
{α : Type u_1} → Matroid α → Set α → Matroid αThe deletion M \ D is the restriction of a matroid M to M.E \ D.
Its independent sets are the M-independent subsets of M.E \ D.
- Cited by
- 86 results in Mathlib
- Foundations
- Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Matroidstatement and proof · cited by 1,258
- Matroid.Eproof · cited by 550
- Matroid.restrictproof · cited by 111
Cited by88
Results whose statement or proof uses this declaration.
- Matroid.contractproof · cited by 103
- Matroid.IsMinorproof · cited by 19
- Matroid.dual_contractstatement and proof · cited by 9
- Matroid.dual_delete_dualstatement · cited by 9
- Matroid.delete_deletestatement and proof · cited by 8
- Matroid.restrict_complstatement · cited by 8
- Matroid.delete_indep_iffstatement · cited by 7
- Matroid.contract_inter_ground_eqproof · cited by 7
- Matroid.delete_groundstatement · cited by 6
- Matroid.dual_deletestatement and proof · cited by 5
- Matroid.IsBasis'.contract_eq_contract_deletestatement and proof · cited by 5
- Matroid.contract_contractproof · cited by 5