| Line 8: | Line 8: | ||
---- | ---- | ||
| − | You should consider K1 as bipartite, it is perfectly legal to have one of the sets V1 or V2 to be empty. The definition requires V1 and V2 to be disjoint, but doesn't require them to be nonempty--[[User:Asuleime|Asuleime]] 22:55, 5 November 2008 (UTC) | + | You should consider K1 as bipartite, it is perfectly legal to have one of the sets V1 or V2 to be empty. The definition requires V1 and V2 to be disjoint, but doesn't require them to be nonempty.<br> |
| + | --[[User:Asuleime|Asuleime]] 22:55, 5 November 2008 (UTC) | ||
Revision as of 17:55, 5 November 2008
So this question asks for which valus of n are Kn, Cn, Wn and Qn bipartite.
>>> are we supposed to consider n=0 or are these graphs only defined for n>0?--Tsnowdon 18:18, 1 November 2008 (UTC)
--- n>0, otherwise the graph would have no vertices. rtabchou
Are we supposed to consider n=1 for K1 as bipartite, or do we need at least 2 vertices for a bipartite graph?
I think it's supposed to be n > 1.
You should consider K1 as bipartite, it is perfectly legal to have one of the sets V1 or V2 to be empty. The definition requires V1 and V2 to be disjoint, but doesn't require them to be nonempty.
--Asuleime 22:55, 5 November 2008 (UTC)
