Publications

Detailed Information

A multicomplex of partially edge-rooted forests

DC Field Value Language
dc.contributor.authorKook, Woong-
dc.date.accessioned2023-07-14T04:31:20Z-
dc.date.available2023-07-14T04:31:20Z-
dc.date.created2023-07-11-
dc.date.issued2012-05-
dc.identifier.citationEuropean Journal of Combinatorics, Vol.33 No.4, pp.505-509-
dc.identifier.issn0195-6698-
dc.identifier.urihttps://hdl.handle.net/10371/195175-
dc.description.abstractA coned graph Ĝ is the union of a finite graph G and a star on its vertices. In this paper, we show that the h-vector of the cycle matroid of Ĝ is the f-vector of a pure multicomplex constructed from the partially edge-rooted forests in G. This result proves a conjecture by Stanley (1996). [6] in the case of the cycle matroid of coned graphs. © 2011 Elsevier Ltd.-
dc.language영어-
dc.publisherAcademic Press-
dc.titleA multicomplex of partially edge-rooted forests-
dc.typeArticle-
dc.identifier.doi10.1016/j.ejc.2011.11.006-
dc.citation.journaltitleEuropean Journal of Combinatorics-
dc.identifier.scopusid2-s2.0-84855405560-
dc.citation.endpage509-
dc.citation.number4-
dc.citation.startpage505-
dc.citation.volume33-
dc.description.isOpenAccessY-
dc.contributor.affiliatedAuthorKook, Woong-
dc.type.docTypeArticle-
dc.description.journalClass1-
Appears in Collections:
Files in This Item:
There are no files associated with this item.

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share