{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:26:08Z","timestamp":1753889168174},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1007\/bf01215916","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T15:19:53Z","timestamp":1109344793000},"page":"339-344","source":"Crossref","is-referenced-by-count":4,"title":["Covering a symmetric poset by symmetric chains"],"prefix":"10.1007","volume":"17","author":[{"given":"Tam\ufffds","family":"Fleiner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"258","volume":"247","author":"C. Berge","year":"1958","unstructured":"C. Berge: Sur le couplage maximum d'un graphe,Comptes Rentus Hebdomadaires des S\u00e9ances de l'Acad\u00e9mie des Sciences [Paris],247 (1958) 258?259.","journal-title":"Comptes Rentus Hebdomadaires des S\u00e9ances de l'Acad\u00e9mie des Sciences [Paris]"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","volume":"51","author":"R. P. Dilworth","year":"1950","unstructured":"R. P. Dilworth: A decomposition theorem for partially ordered sets,Annals of Mathematics,51 (1950) 161?166.","journal-title":"Annals of Mathematics"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds: Paths, tress, and flowers,Canadian Journal of Mathematics,17 (1965) 449?467.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR4","unstructured":"A. Frank: personal communication"},{"key":"CR5","first-page":"373","volume":"8","author":"T. Gallai","year":"1963","unstructured":"T. Gallai: Neuer Beweis eines Tutte'schen Satzes,A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei,8 (1963) 373?395.","journal-title":"A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"},{"key":"CR6","first-page":"401","volume":"9","author":"T. Gallai","year":"1964","unstructured":"T. Gallai: Maximale Systeme unabh\u00e4ngiger Kanten,A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei,9 (1964) 401?413.","journal-title":"A Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zet\u00e9nek K\u00f6zlem\u00e9nyei"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215916.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01215916\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01215916","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T09:56:46Z","timestamp":1556791006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01215916"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["BF01215916"],"URL":"https:\/\/doi.org\/10.1007\/bf01215916","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}