Skip to main content
SpringerLink
Log in

Bicliques in Graphs I: Bounds on Their Number

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Mathematisches Seminar, Universität Hamburg; Bundesstr. 55, 20146 Hamburg, Germany; E-mail: ms6a013@math.uni-hamburg.de, , , , , , DE

    Erich Prisner

Authors
  1. Erich Prisner
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received January 27, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Prisner, E. Bicliques in Graphs I: Bounds on Their Number. Combinatorica 20, 109–117 (2000). https://doi.org/10.1007/s004930070035

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004930070035

Search

Navigation