h -vectors of graph polytopes using activities of dissecting spanning trees

h -vectors of graph polytopes using activities of dissecting spanning trees

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Algebraic combinatorics 2023-01, Vol.6 (6), p.1637-1651
Hauptverfasser: Kálmán, Tamás, Tóthmérész, Lilla
Format: Artikel
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1651
container_issue 6
container_start_page 1637
container_title Algebraic combinatorics
container_volume 6
creator Kálmán, Tamás
Tóthmérész, Lilla
description
doi_str_mv 10.5802/alco.318
format Article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_5802_alco_318</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_5802_alco_318</sourcerecordid><originalsourceid>FETCH-LOGICAL-c227t-43372674f69d12920f34c7c900e6cc3ff295da51e4c9a95f555b65eaa2fcc3173</originalsourceid><addsrcrecordid>eNpNkEtLAzEUhYMoWGrBn5Clm6nJzSSZLKX4KBbc6HqImaSNjJMhNxb6751RF67OgfNYfIRcc7aWDYNb27u0Frw5IwuQjalk3ajzf_6SrBA_GGMgjdJgFuT5QKujdyVlpCnQfbbjgY6pP5U0eqRfGIc9ta7EYyzR_3S6iDgt5gBHOwyzKdl7vCIXwfboV3-6JG8P96-bp2r38rjd3O0qB6BLVQuhQek6KNNxMMCCqJ12hjGvnBMhgJGdldzXzlgjg5TyXUlvLYQp5losyc3vr8sJMfvQjjl-2nxqOWtnDu3MoZ04iG9GolFe</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>h -vectors of graph polytopes using activities of dissecting spanning trees</title><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><creator>Kálmán, Tamás ; Tóthmérész, Lilla</creator><creatorcontrib>Kálmán, Tamás ; Tóthmérész, Lilla</creatorcontrib><identifier>ISSN: 2589-5486</identifier><identifier>EISSN: 2589-5486</identifier><identifier>DOI: 10.5802/alco.318</identifier><language>eng</language><ispartof>Algebraic combinatorics, 2023-01, Vol.6 (6), p.1637-1651</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c227t-43372674f69d12920f34c7c900e6cc3ff295da51e4c9a95f555b65eaa2fcc3173</citedby><cites>FETCH-LOGICAL-c227t-43372674f69d12920f34c7c900e6cc3ff295da51e4c9a95f555b65eaa2fcc3173</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,864,27924,27925</link.rule.ids></links><search><creatorcontrib>Kálmán, Tamás</creatorcontrib><creatorcontrib>Tóthmérész, Lilla</creatorcontrib><title>h -vectors of graph polytopes using activities of dissecting spanning trees</title><title>Algebraic combinatorics</title><issn>2589-5486</issn><issn>2589-5486</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNpNkEtLAzEUhYMoWGrBn5Clm6nJzSSZLKX4KBbc6HqImaSNjJMhNxb6751RF67OgfNYfIRcc7aWDYNb27u0Frw5IwuQjalk3ajzf_6SrBA_GGMgjdJgFuT5QKujdyVlpCnQfbbjgY6pP5U0eqRfGIc9ta7EYyzR_3S6iDgt5gBHOwyzKdl7vCIXwfboV3-6JG8P96-bp2r38rjd3O0qB6BLVQuhQek6KNNxMMCCqJ12hjGvnBMhgJGdldzXzlgjg5TyXUlvLYQp5losyc3vr8sJMfvQjjl-2nxqOWtnDu3MoZ04iG9GolFe</recordid><startdate>20230101</startdate><enddate>20230101</enddate><creator>Kálmán, Tamás</creator><creator>Tóthmérész, Lilla</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20230101</creationdate><title>h -vectors of graph polytopes using activities of dissecting spanning trees</title><author>Kálmán, Tamás ; Tóthmérész, Lilla</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c227t-43372674f69d12920f34c7c900e6cc3ff295da51e4c9a95f555b65eaa2fcc3173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kálmán, Tamás</creatorcontrib><creatorcontrib>Tóthmérész, Lilla</creatorcontrib><collection>CrossRef</collection><jtitle>Algebraic combinatorics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kálmán, Tamás</au><au>Tóthmérész, Lilla</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>h -vectors of graph polytopes using activities of dissecting spanning trees</atitle><jtitle>Algebraic combinatorics</jtitle><date>2023-01-01</date><risdate>2023</risdate><volume>6</volume><issue>6</issue><spage>1637</spage><epage>1651</epage><pages>1637-1651</pages><issn>2589-5486</issn><eissn>2589-5486</eissn><doi>10.5802/alco.318</doi><tpages>15</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 2589-5486
ispartof Algebraic combinatorics, 2023-01, Vol.6 (6), p.1637-1651
issn 2589-5486
2589-5486
language eng
recordid cdi_crossref_primary_10_5802_alco_318
source DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection
title h -vectors of graph polytopes using activities of dissecting spanning trees
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T00%3A02%3A52IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=h%20-vectors%20of%20graph%20polytopes%20using%20activities%20of%20dissecting%20spanning%20trees&rft.jtitle=Algebraic%20combinatorics&rft.au=K%C3%A1lm%C3%A1n,%20Tam%C3%A1s&rft.date=2023-01-01&rft.volume=6&rft.issue=6&rft.spage=1637&rft.epage=1651&rft.pages=1637-1651&rft.issn=2589-5486&rft.eissn=2589-5486&rft_id=info:doi/10.5802/alco.318&rft_dat=%3Ccrossref%3E10_5802_alco_318%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true