OAI/Combinatorics/MatchingCount/Graphs/FillHoles.lean

GitHub source file

12 declarations, 0 contain sorry, 0 declared as axioms

  1. theorem OAI.MatchingFPRAS.Switching.mate_mem_holes_iff line 11
  2. def OAI.MatchingFPRAS.Switching.fillHoles line 16
  3. theorem OAI.MatchingFPRAS.Switching.fillHoles_apply line 31
  4. theorem OAI.MatchingFPRAS.Switching.fillHoles_perfect line 35
  5. theorem OAI.MatchingFPRAS.Switching.fillHoles_injective line 48
  6. theorem OAI.MatchingFPRAS.Switching.fillHoles_weight_le line 61
  7. theorem OAI.MatchingFPRAS.Switching.fillHoles_partition_le line 87
  8. theorem OAI.MatchingFPRAS.Switching.mate_edge_count line 120
  9. theorem OAI.MatchingFPRAS.Switching.weight_div_const line 154
  10. theorem OAI.MatchingFPRAS.Switching.pairing_exists line 164
  11. def OAI.MatchingFPRAS.Switching.pairingCapacity line 217
  12. theorem OAI.MatchingFPRAS.Switching.logical_hole_bound line 223