Talk:Bipartite dimension

Connection to set basis problem
I'm confused as how the set basis problem fits in here. I see how the collection of sets can be viewed as a bipartite graph, but it's not clear that when you translate the problem to this view you get anything relating to bipartite dimension. --RDBury (talk) 05:50, 18 August 2013 (UTC)
 * In the set basis problem, we are given a collection C of sets over a universe of elements, and the problem is to determine a family F of sets such that every set in C can be expressed as a union of sets in F. C can be interpreted as a bipartite graph with sets on one side and elements on the other. Every set S in a family F of sets corresponds to a biclique that has the elements of S on the element side and the sets in C that are subsets of S on the set side. F is a set basis if and only if these bicliques cover the bipartite graph determined by C.
 * By the way, re your recent tagging of the article as lacking inline sources: see Please see WP:HARV. The article does in fact have many inline citations, in an approved style for Wikipedia. —David Eppstein (talk) 06:18, 18 August 2013 (UTC)

External links modified
Hello fellow Wikipedians,

I have just modified one external link on Bipartite dimension. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:
 * Added archive https://web.archive.org/web/20100724221932/http://11011110.livejournal.com/134829.html to http://11011110.livejournal.com/134829.html

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

Cheers.— InternetArchiveBot  (Report bug) 23:30, 5 April 2017 (UTC)