Skip to main content
SpringerLink
Log in

The number of linear extensions of bipartite graphs

  • Published:
Order Aims and scope Submit manuscript

Abstract

The number of linear extensions among the orientations of a bipartite graph is maximum just if the orientation itself is bipartite, the natural one.

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

References

  1. M. D. Atkinson (1988) Two problems on the number of linear extensions, in Algorithms and Order (I. Rival, ed.) Ottawa, Kluwer Acad. Publ., Dordrecht.

    Google Scholar 

  2. R. Stanley (1986) Two poset polytopes, Discrete Comput. Geom. 1, 9–23.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, ul. Przesmyckiego 20, 51151, Wrocław, Poland

    Grzegorz Stachowiak

Authors
  1. Grzegorz Stachowiak
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by I. Rival

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stachowiak, G. The number of linear extensions of bipartite graphs. Order 5, 257–259 (1988). https://doi.org/10.1007/BF00354893

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

AMS subject classification (1980)

Key words

Search

Navigation