Also found in: Thesaurus, Medical, Legal, Encyclopedia.


1. Having or consisting of two parts.
a. Having two corresponding parts, one for each party: a bipartite contract.
b. Having two participants; joint: a bipartite agreement.
3. Botany Divided into two portions almost to the base, as certain leaves.

[Latin bipartītus, past participle of bipartīre, to divide into two parts : bi-, two; see bi-1 + partīre, to part (from pars, part-, a share; see perə- in Indo-European roots).]

bi·par′tite′ly adv.
bi′par·ti′tion (-tĭsh′ən) n.
Mentioned in ?
References in classic literature ?
Returning to the original conversation, don't you find, Anak, that though Loria handles the bipartition of the revenues with scrupulous care, he yet omits one important factor, namely--"
Every bipartition of a bipartite graph is a monopolar partition.
Chez eux, la bipartition dravidienne qui oppose les consanguins et les allies a en effet une portee d'ordre global et non simplement local: elle s'applique de facon coherente d'un bout a l'autre de la societe, ce qui n'est habituellement le cas que dans les societes a moities.
2011b, Theorem 8)--equivalent in this case for any X-tree T = (V, E) and any bipartition of X into two disjoint non-empty subsets A, B:
1 Suppose that G = G(V, E) has a bipartition V = [V.
Que l'on fasse intervenir l'une ou l'autre des oppositions, on aboutit a une meme bipartition des choses et des etres, a un <<dualisme fondamental>> (ibid.
It is straightforward to check that in a split graph, this implies that there exists a bipartition (S, K), where t [member of] S.
i) Throughout this paper, a bicoloured graph is a bipartite graphs with a specified ordered bipartition.
i] [member of] V(G) form an independent set I of G, and therefore G is a split graph with bipartition V(G) = C [union] I.
We call the two sets in the bipartition of V(A) bosons and fermions, though the actual choice is mostly arbitrary and we do not consider it part of the data.
Hence, all edges between sets A and B exist and thus, recalling that G has no triangles, G is the complete bipartite graph with bipartition (A [union] {y}, B [union] {x}).
2]] and that this algebra has a bipartition degree given by the exponent partitions in the two sets of variables.