{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:34:33Z","timestamp":1772516073752,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,5,1]],"date-time":"2007-05-01T00:00:00Z","timestamp":1177977600000},"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":[[2007,5]]},"DOI":"10.1007\/s00493-007-2086-y","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T05:17:24Z","timestamp":1211951844000},"page":"253-267","source":"Crossref","is-referenced-by-count":52,"title":["Independent systems of representatives in weighted graphs"],"prefix":"10.1007","volume":"27","author":[{"given":"Ron","family":"Aharoni","sequence":"first","affiliation":[]},{"given":"Eli","family":"Berger","sequence":"additional","affiliation":[]},{"given":"Ran","family":"Ziv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,5,29]]},"reference":[{"issue":"1","key":"2086_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s004930170001","volume":"21","author":"R. Aharoni","year":"2001","unstructured":"R. Aharoni: Ryser\u2019s conjecture for 3-partite 3-graphs, Combinatorica 21(1) (2001), 1\u20134.","journal-title":"Combinatorica"},{"issue":"3","key":"2086_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/s004930200016","volume":"22","author":"R. Aharoni","year":"2002","unstructured":"R. Aharoni, E. Berger and R. Ziv: A tree version of K\u00f6nig\u2019s theorem, Combinatorica 22(3) (2002), 335\u2013343.","journal-title":"Combinatorica"},{"key":"2086_CR3","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s00454-002-2792-6","volume":"28","author":"R. Aharoni","year":"2002","unstructured":"R. Aharoni, M. Chudnovsky and A. Kotlov: Triangulated spheres and colored cliques, Disc. Comput. Geometry 28 (2002), 223\u2013229.","journal-title":"Disc. Comput. Geometry"},{"key":"2086_CR4","unstructured":"R. Aharoni and M. Chudnovsky: Special triangulations of the simplex and systems of disjoint representatives, unpublished."},{"key":"2086_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V","volume":"35","author":"R. Aharoni","year":"2000","unstructured":"R. Aharoni and P. Haxell: Hall\u2019s theorem for hypergraphs, J. of Graph Theory 35 (2000), 83\u201388.","journal-title":"J. of Graph Theory"},{"key":"2086_CR6","unstructured":"A. Bj\u00f6rner: Topological methods, in: Handbook of Combinatorics (R. Graham, M. Gr\u00f6tschel and L. Lov\u00e1sz editors), Elsevier and the MIT Press (1995)."},{"key":"2086_CR7","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1137\/0403018","volume":"3","author":"M. Fellows","year":"1990","unstructured":"M. Fellows: Transversals of vertex partitions in graphs, SIAM Journal of Disc. Math. 3 (1990), 206\u2013215.","journal-title":"SIAM Journal of Disc. Math."},{"key":"2086_CR8","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0012-365X(92)90588-7","volume":"101","author":"H. Fleischner","year":"1992","unstructured":"H. Fleischner and M. Stiebitz: A solution to a coloring problem of P. Erd\u0151s, Discrete Math. 101 (1992), 39\u201348.","journal-title":"Discrete Math."},{"key":"2086_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jctb.1995.1011","volume":"63","author":"F. Galvin","year":"1995","unstructured":"F. Galvin: The list chromatic index of a bipartite multigraph, J. Combin. Theory Ser. B 63 (1995), 153\u2013158.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2086_CR10","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall: On representation of subsets, J. London Math. Soc. 10 (1935), 26\u201330.","journal-title":"J. London Math. Soc."},{"key":"2086_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01793010","volume":"11","author":"P. E. Haxell","year":"1995","unstructured":"P. E. Haxell: A condition for matchability in hypergraphs, Graphs and Combinatorics 11 (1995), 245\u2013248.","journal-title":"Graphs and Combinatorics"},{"key":"2086_CR12","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1017\/S0963548301004758","volume":"10","author":"P. E. Haxell","year":"2001","unstructured":"P. E. Haxell: A note on vertex list coloring, Combin. Probab. Comput. 10 (2001), 345\u2013347.","journal-title":"Combin. Probab. Comput."},{"key":"2086_CR13","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1017\/S0963548304006157","volume":"13","author":"P. E. Haxell","year":"2004","unstructured":"P. E. Haxell: On the strong chromatic number, Comb. Prob. and Computing 13 (2004), 857\u2013865.","journal-title":"Comb. Prob. and Computing"},{"key":"2086_CR14","unstructured":"P. E. Haxell: private communication."},{"issue":"1","key":"2086_CR15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s004930170006","volume":"21","author":"R. Meshulam","year":"2001","unstructured":"R. Meshulam: The clique complex and hypergraph matching, Combinatorica 21(1) (2001), 89\u201394.","journal-title":"Combinatorica"},{"key":"2086_CR16","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0097-3165(03)00045-1","volume":"102","author":"R. Meshulam","year":"2003","unstructured":"R. Meshulam: Domination numbers and homology, J. Combin. Theory Ser. A 102 (2003), 321\u2013330.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2086_CR17","unstructured":"R. Meshulam: private communication."},{"key":"2086_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(96)00300-7","volume":"176","author":"R. Yuster","year":"1997","unstructured":"R. Yuster: Independent transversals in r-partite graphs, Discrete Math. 176 (1997), 255\u2013261.","journal-title":"Discrete Math."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2086-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-007-2086-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-007-2086-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:45Z","timestamp":1559093565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-007-2086-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,5]]}},"alternative-id":["2086"],"URL":"https:\/\/doi.org\/10.1007\/s00493-007-2086-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,5]]}}}