IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v42y2017i4p1219-1229.html
   My bibliography  Save this article

Graph Orientations and Linear Extensions

Author

Listed:
  • Benjamin Iriarte

    (Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139)

Abstract

Given an underlying undirected simple graph, we consider the set of its acyclic orientations. Each of these orientations induces a partial order on the vertices of our graph and, therefore, we can count the number of linear extensions of these posets. We want to know which choice of orientation maximizes the number of linear extensions of the corresponding poset, and this problem will be solved essentially for comparability graphs and odd cycles, presenting several proofs. The corresponding enumeration problem for arbitrary simple graphs will be studied, including the case of random graphs; this will culminate in (1) new bounds for the volume of the stable set polytope and (2) strong concentration results for our enumerative statistic and for the graph entropy, which hold true a.s. for random graphs. We will then argue that our problem springs up naturally in the theory of graphical arrangements and graphical zonotopes.

Suggested Citation

  • Benjamin Iriarte, 2017. "Graph Orientations and Linear Extensions," Mathematics of Operations Research, INFORMS, vol. 42(4), pages 1219-1229, November.
    • Handle: RePEc:inm:ormoor:v:42:y:2017:i:4:p:1219-1229
    DOI: 10.1287/moor.2016.0845
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/moor.2016.0845
    Download Restriction: no
    File URL: https://libkey.io/10.1287/moor.2016.0845?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ormoor:v:42:y:2017:i:4:p:1219-1229. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.