A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Bipartite bihypergraphs: A survey and new results

2006
*
Discrete Mathematics
*

Let H 0 and H 1 be hypergraphs with the same vertex-set V . The ordered pair In Section 1, we survey numerous applications of bipartite bihypergraphs. In Section 3, we show that recognizing bipartite bihypergraphs within classes of k-complete bihypergraphs can be done in polynomial time. A bihypergraph H = (H 0 , H 1 ) is called k-complete, k 0, if each k-subset of V (H ) contains a hyperedge of H, i.e., a hyperedge of H 0 or H 1 . Moreover, we can construct all bipartitions of a k-complete

doi:10.1016/j.disc.2005.10.026
fatcat:aszv3zjsufa53lilud5yq2j3ci