{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T11:40:39Z","timestamp":1765280439354,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:00:00Z","timestamp":1718668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T00:00:00Z","timestamp":1718668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes with their triangulations), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into independent sets. More generally, we give bijections between facet partitions whose parts have minimal distance <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ge s$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mi>s<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and vertex partitions whose parts have minimal distance <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\ge s+1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mi>s<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s00373-024-02804-6","type":"journal-article","created":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T15:14:31Z","timestamp":1718723671000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Partitions of Vertices and Facets in Trees and Stacked Simplicial Complexes"],"prefix":"10.1007","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9796-7530","authenticated-orcid":false,"given":"Gunnar","family":"Fl\u00f8ystad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"issue":"5","key":"2804_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2021.106924","volume":"226","author":"A Almousa","year":"2022","unstructured":"Almousa, A., Fl\u00f8ystad, G., Lohne, H.: Polarizations of powers of graded maximal ideals. J. Pure Appl. Algebra 226(5), 106924 (2022)","journal-title":"J. Pure Appl. Algebra"},{"issue":"2","key":"2804_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.ejc.2004.02.009","volume":"26","author":"WY Chen","year":"2005","unstructured":"Chen, W.Y., Deng, E.Y., Du, R.R.: Reduction of m-regular noncrossing partitions. Eur. J. Comb. 26(2), 237\u2013243 (2005)","journal-title":"Eur. J. Comb."},{"issue":"15","key":"2804_CR3","doi-asserted-by":"publisher","first-page":"3163","DOI":"10.1016\/j.disc.2007.06.041","volume":"308","author":"W Chu","year":"2008","unstructured":"Chu, W., Wei, C.: Set partitions with restrictions. Discrete Math. 308(15), 3163\u20133168 (2008)","journal-title":"Discrete Math."},{"issue":"09.7.1","key":"2804_CR4","first-page":"1","volume":"12","author":"B Duncan","year":"2009","unstructured":"Duncan, B., Peele, R.: Bell and Stirling numbers for graphs. J. Integer Seq. 12(09.7.1), 1\u201313 (2009)","journal-title":"J. Integer Seq."},{"key":"2804_CR5","doi-asserted-by":"crossref","unstructured":"Duval, A.M., Klivans, C.J., Martin, J.L.: Simplicial and Cellular Trees. Recent Trends in Combinatorics, pp. 713\u2013752 (2016)","DOI":"10.1007\/978-3-319-24298-9_28"},{"issue":"2","key":"2804_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00229-002-0293-9","volume":"109","author":"S Faridi","year":"2002","unstructured":"Faridi, S.: The facet ideal of a simplicial complex. Manuscr. Math. 109(2), 159\u2013174 (2002)","journal-title":"Manuscr. Math."},{"key":"2804_CR7","unstructured":"Fl\u00f8ystad, G., Mafi, A.: Polarizations of artin monomial ideals define triangulated balls (2022). arXiv:2212.09528"},{"issue":"3","key":"2804_CR8","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/s10801-022-01174-7","volume":"57","author":"G Fl\u00f8ystad","year":"2023","unstructured":"Fl\u00f8ystad, G., Orlich, M.: Triangulations of polygons and stacked simplicial complexes: separating their Stanley-Reisner ideals. J. Algebraic Comb. 57(3), 659\u201386 (2023)","journal-title":"J. Algebraic Comb."},{"key":"2804_CR9","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes, Graduate Texts in Mathematics, vol. 221, 2nd edn. Springer, New York (2003) (Prepared and with a preface by Volker Kaibel, Victor Klee and G\u00fcnter M. Ziegler)","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"2804_CR10","unstructured":"Hertz, A., M\u00e9lot, H.: Counting the number of non-equivalent vertex colorings of a graph. Les Cahiers du GERAD ISSN G-2013-82, pp. 1\u201316 (2013)"},{"key":"2804_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-106-6","volume-title":"Monomial Ideals","author":"J Herzog","year":"2011","unstructured":"Herzog, J., Hibi, T.: Monomial Ideals. Springer, New York (2011)"},{"key":"2804_CR12","first-page":"264","volume":"58","author":"Z Keresk\u00e9nyi-Balogh","year":"2014","unstructured":"Keresk\u00e9nyi-Balogh, Z., Nyul, G.: Stirling numbers of the second kind and Bell numbers for graphs. Australas. J Comb. 58, 264\u2013274 (2014)","journal-title":"Australas. J Comb."},{"key":"2804_CR13","volume-title":"Combinatorics of Set Partitions","author":"T Mansour","year":"2013","unstructured":"Mansour, T.: Combinatorics of Set Partitions. CRC Press, Boca Raton (2013)"},{"issue":"5","key":"2804_CR14","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1016\/j.ejc.2007.06.003","volume":"29","author":"AO Munagi","year":"2008","unstructured":"Munagi, A.O.: Extended set partitions with successions. Eur. J. Comb. 29(5), 1298\u20131308 (2008)","journal-title":"Eur. J. Comb."},{"issue":"1\u20133","key":"2804_CR15","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(96)00034-9","volume":"156","author":"W Yang","year":"1996","unstructured":"Yang, W.: Bell numbers and k-trees. Discrete Math. 156(1\u20133), 247\u2013252 (1996)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02804-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02804-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02804-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T19:04:20Z","timestamp":1723230260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02804-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,18]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2804"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02804-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,6,18]]},"assertion":[{"value":"24 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"79"}}