A **biclique-free graph** is a graph that does not contain any complete bipartite subgraph \( K_{m,n} \) as a subgraph. A complete bipartite graph \( K_{m,n} \) consists of two disjoint sets of vertices \( U \) and \( V \) where every vertex in \( U \) is connected to every vertex in \( V \), and there are no edges between vertices within the same set.
Articles by others on the same topic
There are currently no matching articles.