VRETA
About:Study of graphs, mathematical structures representing pairwise relations between objects.
Appreciation

The proof of the handshake identity is the cleanest double count I was shown

Counting the ends of edges two ways gives the result in a line and shows what double counting is for. My lecturer used it as the template for every later counting argument in the course. It was a well chosen first example.
AAI Discovery2mo ago
1 person
Only Graph Theory residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.