{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T12:34:33Z","timestamp":1774528473623,"version":"3.50.1"},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2014,9]]},"abstract":"<jats:p> The unsolved Erd\u0151s\u2013Faber\u2013Lov\u00e1sz conjecture states that if a hypergraph has n edges, each of size n, and every pair of edges intersect in at most one vertex, then its vertex chromatic number is equal to n. Hindman proved it for n \u2264 10; here we extend this result up to n \u2264 12. <\/jats:p>","DOI":"10.1142\/s1793830914500396","type":"journal-article","created":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T06:27:23Z","timestamp":1395296843000},"page":"1450039","source":"Crossref","is-referenced-by-count":7,"title":["The Erd\u0151s\u2013Faber\u2013Lov\u00e1sz conjecture is true for n \u2264 12"],"prefix":"10.1142","volume":"06","author":[{"given":"David","family":"Romero","sequence":"first","affiliation":[{"name":"Instituto de Matem\u00e1ticas, Universidad Nacional Aut\u00f3noma de M\u00e9xico, Av. Universidad s\/n., Cuernavaca, Morelos, 62210, Mexico"}]},{"given":"Federico","family":"Alonso-Pecina","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma del Estado de Morelos, Av. Universidad 1001, Cuernavaca, Morelos, 62209, Mexico"}]}],"member":"219","published-online":{"date-parts":[[2014,6,16]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511666919"},{"key":"rf2","first-page":"118","volume":"7","author":"Betten A.","journal-title":"J. Combin. Designs"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1201\/9781420049954"},{"key":"rf4","first-page":"421","author":"Doyen J.","journal-title":"Bull. Soc. Math. Belg."},{"key":"rf5","first-page":"257","volume":"28","author":"Dukes W. M. B.","journal-title":"Australas. J. Combin."},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.4310\/JOC.2010.v1.n2.a2"},{"key":"rf8","volume-title":"Tabu Search","author":"Glover F.","year":"1999"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1981-046-9"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1007\/s00022-007-1960-5"},{"key":"rf11","first-page":"381","author":"Libois P.","journal-title":"Bull. Soc. Math. Belg."},{"key":"rf12","first-page":"497","volume":"97","author":"Mitchem J.","journal-title":"Ars Combin."},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830912500036"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198571278.003.0017"},{"key":"rf15","first-page":"71","volume":"85","author":"Romero D.","journal-title":"Ars Combin."},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.09.026"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2010.06.001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830914500396","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T17:16:02Z","timestamp":1565111762000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830914500396"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,16]]},"references-count":16,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2014,6,16]]},"published-print":{"date-parts":[[2014,9]]}},"alternative-id":["10.1142\/S1793830914500396"],"URL":"https:\/\/doi.org\/10.1142\/s1793830914500396","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,16]]}}}