{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:35:01Z","timestamp":1778862901233,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9694,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1987,1]]},"DOI":"10.1016\/0166-218x(87)90053-9","type":"journal-article","created":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T12:34:03Z","timestamp":1042806843000},"page":"51-58","source":"Crossref","is-referenced-by-count":25,"title":["Fractional matchings and the Edmonds-Gallai theorem"],"prefix":"10.1016","volume":"16","author":[{"given":"W.R","family":"Pulleyblank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90053-9_BIB1","first-page":"1","article-title":"Integer and fractional matchings","volume":"11","author":"Balas","year":"1981","journal-title":"Annals Discrete Math."},{"key":"10.1016\/0166-218X(87)90053-9_BIB2","series-title":"Proc. Princeton Symposium on Mathematical Programming","first-page":"303","article-title":"On maximum matching, minimum covering and their connections","author":"Balinski","year":"1970"},{"key":"10.1016\/0166-218X(87)90053-9_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0095-8956(86)90085-7","article-title":"An extension of matching theory","volume":"40","author":"Cornu\u00e9jols","year":"1986","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0166-218X(87)90053-9_BIB4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6377(82)90016-5","article-title":"Packing subgraphs in a graph","volume":"1","author":"Cornu\u00e9jols","year":"1982","journal-title":"Oper. Res. Letters"},{"key":"10.1016\/0166-218X(87)90053-9_BIB5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02579340","article-title":"Critical graphs, matchings and tours","volume":"3","author":"Cornu\u00e9jols","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(87)90053-9_BIB6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(87)90053-9_BIB7","doi-asserted-by":"crossref","first-page":"147","DOI":"10.6028\/jres.069B.016","article-title":"Transversals and matroid partition","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0166-218X(87)90053-9_BIB8","first-page":"133","article-title":"\u00dcber extreme Punkt-und Kantenmengen","volume":"2","author":"Gallai","year":"1959","journal-title":"Ann. Univ. Sci. Budapest, R. E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/0166-218X(87)90053-9_BIB9","series-title":"Combinatorial Optimization, Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(87)90053-9_BIB10","first-page":"279","article-title":"A note on factor-critical graphs","volume":"7","author":"Lov\u00e1sz","year":"1972","journal-title":"Stud. Sci. Math. Hung."},{"key":"10.1016\/0166-218X(87)90053-9_BIB11","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0020-0190(79)90026-7","article-title":"F-factors of graphs: A generalized matching problem","volume":"8","author":"M\u00fchlbacher","year":"1979","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0166-218X(87)90053-9_BIB12","series-title":"On certain classes of fractional matchings","author":"M\u00fchlbacher","year":"1983"},{"key":"10.1016\/0166-218X(87)90053-9_BIB13","series-title":"Combinatorial Optimization, Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(87)90053-9_BIB14","series-title":"Hypergraph Seminar","first-page":"214","article-title":"Facets of matching polyhedra","author":"Pulleyblank","year":"1974"},{"key":"10.1016\/0166-218X(87)90053-9_BIB15","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","article-title":"The factors of graphs","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(87)90053-9_BIB16","first-page":"13","article-title":"Sur le probl\u00e8me du couplage maximal","volume":"9","author":"Uhry","year":"1975","journal-title":"RAIRO Rech. Op\u00e9r."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900539?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900539?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T07:56:43Z","timestamp":1553932603000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0166218X87900539"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90053-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}