SHARE
TWEET

Untitled

a guest Apr 20th, 2019 83 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. TODO:
  2. practise midterm
  3. practise final
  4.  
  5. tut 6: Let G be a 4-regular graph, and let X be any set of vertices. Prove that the number of edges
  6. in the cut induced by X is even.
  7.  
  8. tut 9: is this induction on k??
  9.  
  10. A9q3
  11. A10q4
  12. A5q3,q4
  13.  
  14. "If G is not
  15. connected, then we can add bridges between components on the outer face to create a
  16. connected graph. We do not create cycles this way, so every cycle has length at least 6,
  17. and we can apply the same upper bound on m."
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
 
Top