I'm studying graph theory and the follow question is driving me crazy. Any hint in any direction would be appreciated.
Here is the question:
Let $G = G[X, Y]$ be a bipartite graph in which each vertex in $X$ is of odd degree. Suppose that any two distinct vertices of $X$ have an even number of common neighbours. Show that $G$ has matching covering every vertex of $X$.