IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v33y2017i2d10.1007_s10878-015-9978-3.html
   My bibliography  Save this article

Trinque problem: covering complete graphs by plane degree-bounded hypergraphs

Author

Listed:
  • Clément Charpentier

    (Université Joseph Fourier / CNRS, UMR 5582)

  • Sylvain Gravier

    (Université Joseph Fourier / CNRS, UMR 5582)

  • Thomas Lecorre

    (Université Joseph Fourier / CNRS, UMR 5582)

Abstract

Let $$K_n$$ K n be a complete graph drawn on the plane with every vertex incident to the infinite face. For any integers i and d, we define the (i, d)-Trinque Number of $$K_n$$ K n , denoted by $${\mathcal {T}}^d_{i}(K_n)$$ T i d ( K n ) , as the smallest integer k such that there is an edge-covering of $$K_n$$ K n by k “plane” hypergraphs of degree at most d and size of edge bounded by i. We compute this number for graphs (that is $$i=2$$ i = 2 ) and gives some bounds for general hypergraphs.

Suggested Citation

  • Clément Charpentier & Sylvain Gravier & Thomas Lecorre, 2017. "Trinque problem: covering complete graphs by plane degree-bounded hypergraphs," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 543-550, February.
    • Handle: RePEc:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9978-3
    DOI: 10.1007/s10878-015-9978-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-015-9978-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-015-9978-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:33:y:2017:i:2:d:10.1007_s10878-015-9978-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.