g acceleration of gravity

1. that covers all the vertices of G?

2. What G?

3. So we say for all G and for all sets

4. Do we still have a connected subgraph of G

5. Jade and Althea kissing on a tree. K-I-S-S-I-N-G!

6. So all vertices in G are still connected

7. Well, of course it cover all the vertices of G

8. So we already know that T is a connected subgraph of G

9. What is G?

10. a connected graph G.

11. is that for any connected weighted graph G,

12. So I have to prove that for all G,

13. So this is the minimum spanning tree for the graph G

14. And we assume that it has the same vertices of G of course.

15. It's defined as the spanning tree of G such

16. What is G?

17. connected, and with the same vertices as G.

18. For all G, I still need to prove there

19. She's really walking in S&G

20. So we know a subgraph of G that touches all the different edges

21. It's defined as the spanning tree of G such

22. with the same vertices of G. So the only difference

23. So what I need to proof is that for all G,

24. there exists a minimum spanning tree of G.

25. So let this be a connected subgraph of G.

26. We said that a connected graph, G-- that's

27. Yes, see you G!

28. there exists a minimum spanning tree of G such

29. So this is the minimum spanning tree for the graph G

30. So what I need to proof is that for all G,

31. let T be a connected subgraph of G, but with a property

32. because we showed that for all graphs G,

33. Do we still have a connected subgraph of G

34. There does not exist a connected graph G that has no ST.