{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:38Z","timestamp":1740107138220,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T00:00:00Z","timestamp":1473206400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s00373-016-1733-8","type":"journal-article","created":{"date-parts":[[2016,9,7]],"date-time":"2016-09-07T15:55:41Z","timestamp":1473263741000},"page":"2241-2252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Families of n-Clusters Verifying the Erd\u0151s\u2013Faber\u2013Lov\u00e1sz Conjecture"],"prefix":"10.1007","volume":"32","author":[{"given":"Gilberto","family":"Calvillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9329-9213","authenticated-orcid":false,"given":"David","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,7]]},"reference":[{"key":"1733_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511666919","volume-title":"The theory of finite linear spaces. Combinatorics of points and lines","author":"L Batten","year":"1993","unstructured":"Batten, L., Beutelspacher, A.: The theory of finite linear spaces. Combinatorics of points and lines. Cambridge University Press, Cambridge (1993)"},{"key":"1733_CR2","first-page":"99","volume":"70","author":"C Berge","year":"1990","unstructured":"Berge, C., Hilton, A.J.W.: On two conjectures about edge-colouring hypergraphs. Congr. Numerantium 70, 99\u2013104 (1990)","journal-title":"Congr. Numerantium"},{"key":"1733_CR3","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1112\/jlms\/s1-42.1.226","volume":"42","author":"M Behzad","year":"1967","unstructured":"Behzad, M., Chartrand, G., Cooper Jr., J.K.: The colour numbers of complete graphs. J. Lond. Math. Soc. 42, 226\u2013228 (1967)","journal-title":"J. Lond. Math. Soc."},{"key":"1733_CR4","first-page":"118","volume":"7","author":"A Betten","year":"1999","unstructured":"Betten, A., Betten, D.: Linear spaces with at most 12 points. J. Comb. Des. 7, 118\u2013145 (1999)","journal-title":"J. Comb. Des."},{"issue":"3","key":"1733_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF02126801","volume":"8","author":"WI Chang","year":"1988","unstructured":"Chang, W.I., Lawler, E.L.: Edge coloring of hypergraphs and a conjecture of Erd\u0151s, Faber, and Lov\u00e1sz. Combinatorica 8(3), 293\u2013295 (1988)","journal-title":"Combinatorica"},{"key":"1733_CR6","unstructured":"Erd\u0151s, P.: Problems and results in graph theory and combinatorial analysis. In: Nash-Williams, S. (ed.) Proceedings of the 5th British Combinatorial Conference, Aberdeen, 1975, Congress Numerantum, vol. 15, pp. 169\u2013192 (1976)"},{"issue":"2","key":"1733_CR7","first-page":"113","volume":"1","author":"V Faber","year":"2010","unstructured":"Faber, V.: The Erd\u0151s-Faber-Lov\u00e1sz conjecture\u2014the uniform regular case. J. Comb. 1(2), 113\u2013120 (2010)","journal-title":"J. Comb."},{"issue":"7\u20138","key":"1733_CR8","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1016\/j.disc.2005.11.053","volume":"307","author":"B Jackson","year":"2007","unstructured":"Jackson, B., Sethuraman, G., Whitehead, C.: A note on the Erd\u0151s-Faber-Lov\u00e1sz conjecture. Discrete Math. 307(7\u20138), 911\u2013915 (2007)","journal-title":"Discrete Math."},{"key":"1733_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0097-3165(92)90096-D","volume":"59","author":"J Kahn","year":"1992","unstructured":"Kahn, J.: Coloring nearly-disjoint hypergraphs with $$n+o(n)$$ n + o ( n ) colors. J. Comb. Theory Ser. A 59, 31\u201339 (1992)","journal-title":"J. Comb. Theory Ser. A"},{"key":"1733_CR10","unstructured":"Libois, P.: G\u00e9om\u00e9trie de la relativit\u00e9 restreinte. Bull. Soc. Math. Belg. XIV, 381\u2013388 (1962, in French)"},{"key":"1733_CR11","first-page":"497","volume":"97","author":"J Mitchem","year":"2010","unstructured":"Mitchem, J., Schmidt, R.L.: On the Erd\u0151s-Faber-Lov\u00e1sz conjecture. Ars Comb. 97, 497\u2013505 (2010)","journal-title":"Ars Comb."},{"key":"1733_CR12","doi-asserted-by":"crossref","unstructured":"Paul, V., Germina, K.A.: On edge coloring of hypergraphs and Erd\u0151s-Faber-Lov\u00e1sz conjecture. Discrete Math. Algorithms Appl. 04, 1250003 [5\u00a0pages] (2012)","DOI":"10.1142\/S1793830912500036"},{"key":"1733_CR13","doi-asserted-by":"crossref","unstructured":"Romero, D., Alonso-Pecina, F.: The Erd\u0151s-Faber-Lov\u00e1sz conjecture is true for $$n\\le 12$$ n \u2264 12 . Discrete Math. Algorithms Appl. 06, 1450039 [5 pages] (2014)","DOI":"10.1142\/S1793830914500396"},{"key":"1733_CR14","first-page":"71","volume":"85","author":"D Romero","year":"2007","unstructured":"Romero, D., S\u00e1nchez-Arroyo, A.: Adding evidence to the Erd\u0151s-Faber-Lov\u00e1sz conjecture. Ars Comb. 85, 71\u201384 (2007)","journal-title":"Ars Comb."},{"key":"1733_CR15","doi-asserted-by":"crossref","unstructured":"Romero, D., S\u00e1nchez-Arroyo, A.: Advances on the Erd\u0151s-Faber-Lov\u00e1sz conjecture. In: Grimmet, G., McDiarmid, C. (eds.) Combinatorics, Complexity and Chance: A Tribute to Dominic Welsh, pp. 285\u2013298. Oxford University Press, Oxford (2007)","DOI":"10.1093\/acprof:oso\/9780198571278.003.0017"},{"key":"1733_CR16","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/j.disc.2007.09.026","volume":"308","author":"A S\u00e1nchez-Arroyo","year":"2008","unstructured":"S\u00e1nchez-Arroyo, A.: The Erd\u0151s-Faber-Lov\u00e1sz conjecture for dense hypergraphs. Discrete Math. 308, 991\u2013992 (2008)","journal-title":"Discrete Math."},{"key":"1733_CR17","unstructured":"V\u00e1zquez, A.: Dos temas en sistemas lineales: la conjetura de Erd\u0151s-Faber-Lov\u00e1sz y transversales. Ph.D.\u00a0Thesis, Instituto de Matem\u00e1ticas, Universidad Nacional Aut\u00f3noma de M\u00e9xico (2014, In Spanish)"},{"key":"1733_CR18","unstructured":"V\u00e1zquez-Avila, A., Araujo-Pardo, G.: A note on Erd\u0151s-Faber-Lov\u00e1sz Conjecture and edge coloring of complete graphs. arXiv:1605.03374v1 (2016, In press)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1733-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-016-1733-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-016-1733-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T03:45:50Z","timestamp":1568346350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-016-1733-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,7]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["1733"],"URL":"https:\/\/doi.org\/10.1007\/s00373-016-1733-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2016,9,7]]}}}