# Are the graphs with no vertex and 1 vertex bipartite?

I am not sure how the definition of bipartite graph fits for these graphs. If they are bipartite where is the bipartition?

-

A bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V; that is, U and V are independent sets. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.

By that definition (which matches the one I'd use, although I'm hardly an authority on such things), any graph with no edges is trivially bipartite.

And, yes, the bipartition of the empty graph consist of two empty sets — the empty set being the only set which is disjoint from itself, since its intersection with itself is empty.

Ps. It is a little known mathematical fact that all elements of the empty set are even, infinite, continuous, true and purple with yellow spots. :-) (They are, of course, also many things besides those.)

-

Can you partition the set of vertices into two subsets (no overlap) such that there are no edges between vertices within either part? Note that a subset can be empty.

-
 but don't I need two subsets? Are you just talking about the graph with one vertice? – Mark Jul 26 '11 at 22:29 Can a subset be the empty set? Do two empty subsets Have a nonempty intersection? – Mitch Jul 26 '11 at 22:36 So are you saying I can use the empty subset twice because they have an empty intersection and therefore is a bipartition? – Mark Jul 26 '11 at 22:50 Do the two empty sets satisfy all the requirements? It seems kinda weird but everything works. – Mitch Jul 27 '11 at 2:50