Return to Question

We examine a bipartite graph with two sides $R$ and $L$, and denote by $|L|$ and $|R|$ the number of nodes in each side. We know only that each node on side $R$ is connected to $k$ nodes on side $L$, that $|R| < k< |L|$, and that $k$ is much larger than $|R|$.

What is the minimal size (i.e., number of edges) of the maximal biclique$^1$?

(1) Maximal biclique: A complete bipartite subgraph, that isn't a subgraph of another complete bipartite subgraph.

We examine a bipartite graph with two sides $R$ and $L$, and denote by $|L|$ and $|R|$ the number of nodes in each side. We know only that each node on side $R$ is connected to $k$ nodes on side $L$, that $|R| < k< |L|$, and that $k$ is much larger than $|R|$.

What is the minimal size (i.e., number of edges) of the maximal biclique¹?

¹maximal biclique: A complete bipartite subgraph, that isn't a subgraph of another complete bipartite subgraph.

We examine a bipartite graph with two sides $R$ and $L$. We know only that each node on side $R$ is connected to $k$ nodes on side $L$, and that $|R| \ll k< |L|$ (where $|L|$ and $|R|$ denote the number of nodes in each side, and $\ll$ denotes "much larger than").

What is the minimal size (i.e., number of edges) of the maximal biclique$^1$?

(1) Maximal biclique: A complete bipartite subgraph, that isn't a subgraph of another complete bipartite subgraph.

We examine a bipartite graph with two sides $R$ and $L$, and denote by $|L|$ and $|R|$ the number of nodes in each side. We know only that each node on side $R$ is connected to $k$ nodes on side $L$, that $|R| < k< |L|$, and that $k$ is much larger than $|R|$.

What is the minimal size (i.e., number of edges) of the maximal biclique$^1$?

(1) Maximal biclique: A complete bipartite subgraph, that isn't a subgraph of another complete bipartite subgraph.

We examine a bipartite graph with two sides $R$ and $L$. We know only that each node on side $R$ is connected to $K$ nodes on side $L$, and that $|R| \ll K< |L|$ (where $|L|$ and $|R|$ denote the number of nodes in each side).

What is the minimal size (i.e., number of edges) of the maximal biclique$^1$?

(1) Maximal biclique: A complete bipartite subgraph, that isn't a subgraph of another complete bipartite subgraph.

We examine a bipartite graph with two sides $R$ and $L$. We know only that each node on side $R$ is connected to $k$ nodes on side $L$, and that $|R| \ll k< |L|$ (where $|L|$ and $|R|$ denote the number of nodes in each side, and $\ll$ denotes "much larger than").

What is the minimal size (i.e., number of edges) of the maximal biclique$^1$?

(1) Maximal biclique: A complete bipartite subgraph, that isn't a subgraph of another complete bipartite subgraph.