3

Answers
votes newest views recent
2
Let G be a graph such that for all u, v ∈ V (G), u no equal to v , |N (u) ∩ N (v )| is odd. Then show that the number of vertices in G is odd
6
Combinatorial results without known combinatorial proofs
8
What is the Tutte polynomial encoding?