{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:23:34Z","timestamp":1771485814069,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214074","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"1079-1090","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["Nearly complete graphs decomposable into large induced matchings and their applications"],"prefix":"10.1145","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Tel Aviv University and Institute for Advanced Study, Tel Aviv, Israel"}]},{"given":"Ankur","family":"Moitra","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, USA"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles, Los Angeles, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10056"},{"key":"e_1_3_2_2_2_1","unstructured":"N. Alon and J. Fox. Testing perfection is hard. To appear.  N. Alon and J. Fox. Testing perfection is hard. To appear."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.04.008"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548306007759"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0035-9"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263424"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.32.12.331"},{"key":"e_1_3_2_2_8_1","volume-title":"Proc.3rd Ann Arbor Conference on Graph Theorey","author":"Brown W. G.","year":"1973"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02018585"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.179355"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90044-W"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1042"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01788085"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509977"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2011.174.1.17"},{"key":"e_1_3_2_2_16_1","unstructured":"J. Fox and P. Loh. On a problem of Erdos and Rothschild on edges in triangles. Combinatorica to appear.  J. Fox and P. Loh. On a problem of Erdos and Rothschild on edges in triangles. Combinatorica to appear."},{"key":"e_1_3_2_2_17_1","first-page":"165","article-title":"Colored packing of sets in combinatorial design theory","volume":"34","author":"F\u00fcredi Z.","year":"1987","journal-title":"Annals of Discrete Math."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1096"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10068"},{"key":"e_1_3_2_2_20_1","unstructured":"R. Meshulam. Private communication 2011.  R. Meshulam. Private communication 2011."},{"key":"e_1_3_2_2_21_1","unstructured":"I. Rusz\u00e1 and E. Szemer\u00e9di. Triple systems with no six points carrying three triangles. Colloquia Mathematica Societatis J\u00e1nos Bolyai 939--945 1978.  I. Rusz\u00e1 and E. Szemer\u00e9di. Triple systems with no six points carrying three triangles. Colloquia Mathematica Societatis J\u00e1nos Bolyai 939--945 1978."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335329"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2011.174.1.20"},{"key":"e_1_3_2_2_24_1","volume-title":"Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas andD. Sotteau, eds.), 399--401","year":"1978"},{"key":"e_1_3_2_2_25_1","unstructured":". Vempala. Private communication 2011.  . Vempala. Private communication 2011."},{"key":"e_1_3_2_2_26_1","first-page":"59","volume-title":"SODA","author":"Zosin L.","year":"2002"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214074","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:56Z","timestamp":1750238456000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":26,"alternative-id":["10.1145\/2213977.2214074","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214074","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}