Bicliques in Graphs I: Bounds on Their Number |
| |
| Authors: | Erich Prisner |
| |
| Institution: | Mathematisches Seminar, Universit?t Hamburg; Bundesstr. 55, 20146 Hamburg, Germany; E-mail: ms6a013@math.uni-hamburg.de, DE
|
| |
| Abstract: | Bicliques are inclusion-maximal induced complete bipartite subgraphs in graphs. Upper bounds on the number of bicliques in bipartite
graphs and general graphs are given. Then those classes of graphs where the number of bicliques is polynomial in the vertex
number are characterized, provided the class is closed under induced subgraphs.
Received January 27, 1997 |
| |
| Keywords: | AMS Subject Classification (1991) Classes: 05C |
| 本文献已被 SpringerLink 等数据库收录！ |
|
