===== Bipartite complete graph =====
==== Set ====
| @#55CCEE: context     | @#55CCEE: $V,E$ ... set |

| @#FFBB00: definiendum | @#FFBB00: $\langle V,E,\psi\rangle \in \mathrm{it}(E,V) $ |

| @#55EE55: postulate   | @#55EE55: $\langle V,E,\psi\rangle $ ... undirected graph |

| @#DDDDDD: range       | @#DDDDDD: $ X\cap Y=\emptyset $ |
| @#DDDDDD: range       | @#DDDDDD: $ x\in X $ |
| @#DDDDDD: range       | @#DDDDDD: $ y\in Y $ |

| @#55EE55: postulate   | @#55EE55: $\exists X,Y.\ (\forall u,v.\ \{u,v\}\in\mathrm{im}(\psi)\implies (u\in X\land v\in Y)\lor (v\in X\land u\in Y)) \land (\forall x,y.\ \{x,y\}\in\mathrm{im}\ \psi) $ |

==== Discussion ====
Let $G$ be a bipartite complete graph with parts $X$ and $Y$. Then $G$ is bipartite complete if each $x\in X$ connects to each $y\in Y$.
==== Parents ====
=== Subset of ===
[[Bipartite graph]]