IDEAS home Printed from https://ideas.repec.org/a/hin/jijmms/947151.html
   My bibliography  Save this article

An Intermediate Value Theorem for the Arboricities

Author

Listed:
  • Avapa Chantasartrassmee
  • Narong Punnim

Abstract

Let be a graph. The vertex (edge) arboricity of denoted by is the minimum number of subsets into which the vertex (edge) set of can be partitioned so that each subset induces an acyclic subgraph. Let be a graphical sequence and let be the class of realizations of . We prove that if , then there exist integers and such that has a realization with if and only if is an integer satisfying . Thus, for an arbitrary graphical sequence and , the two invariants and   naturally arise and hence We write for the degree sequence of an -regular graph of order . We prove that . We consider the corresponding extremal problem on vertex arboricity and obtain in all situations and for all .

Suggested Citation

  • Avapa Chantasartrassmee & Narong Punnim, 2011. "An Intermediate Value Theorem for the Arboricities," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2011, pages 1-7, June.
    • Handle: RePEc:hin:jijmms:947151
    DOI: 10.1155/2011/947151
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/IJMMS/2011/947151.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/IJMMS/2011/947151.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2011/947151?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jijmms:947151. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.