In graph theory, a branch of mathematics, a t-biclique-free graph is a graph that has no Kt,t (complete bipartite graph with 2t vertices) as a subgraph. A family of graphs is biclique-free if there exists a number t such that the graphs in the family are all t-biclique-free.
In graph theory, a branch of mathematics, a t-biclique-free graph is a graph that has no Kt,t (complete bipartite graph with 2t vertices) as a subgraph. A family of graphs is biclique-free if there exists a number t such that the graphs in the family are all t-biclique-free.
Source: Wikipedia "Biclique-free graph" · CC BY-SA 4.0
Share this article: X · Bluesky