Added to Favorites

In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.

- Given a bipartite graph, finding its complete bipartite subgraph $K\_\{m,n\}$ with maximal number of edges $mcdot\; n$ is a NP-complete problem.
- A planar graph cannot contain $K\_\{3,3\}$ as a minor; an outerplanar graph cannot contain $K\_\{3,2\}$ as a minor (These are not sufficient conditions for planarity and outerplanarity, but necessary).
- A complete bipartite graph. $K\_\{n,n\}$ is a Moore graph and a $(n,4)$-cage
- A complete bipartite graph $K\_\{n,n\}$ or $K\_\{n,n+1\}$ is a Turán graph
- A complete bipartite graph $K\_\{m,n\}$ has a vertex covering number of $min\; lbrace\; m,n\; rbrace$ and an edge covering number of $maxlbrace\; m,nrbrace$
- A complete bipartite graph $K\_\{m,n\}$ has a maximum independent set of size $maxlbrace\; m,nrbrace$
- A complete bipartite graph $K\_\{m,n\}$ has a maximum matching of size $minlbrace\; m,nrbrace$
- A complete bipartite graph $K\_\{n,n\}$ has a proper n-edge-coloring
- A complete bipartite graph $K\_\{m,n\}$ has m
^{n-1}n^{m-1}Spanning trees. - The last two results are corollaries of the Marriage Theorem as applied to a k-regular bipartite graph

Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday October 07, 2008 at 12:53:40 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

This article is licensed under the GNU Free Documentation License.

Last updated on Tuesday October 07, 2008 at 12:53:40 PDT (GMT -0700)

View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Copyright © 2014 Dictionary.com, LLC. All rights reserved.