{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:40:03Z","timestamp":1746254403938,"version":"3.40.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:00:00Z","timestamp":1743033600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:00:00Z","timestamp":1743033600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s00373-025-02916-7","type":"journal-article","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T16:03:04Z","timestamp":1743350584000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Diamonds and 4-uniform hypergraphs"],"prefix":"10.1007","volume":"41","author":[{"given":"Wiam","family":"Belkouche","sequence":"first","affiliation":[]},{"given":"Abderrahim","family":"Boussa\u00efri","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9923-4493","authenticated-orcid":false,"given":"Soufiane","family":"Lakhlifi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,27]]},"reference":[{"unstructured":"Baber, R.: Private Communication to K. Gunderson and J. Semeraro (2015)","key":"2916_CR1"},{"issue":"4","key":"2916_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111699","volume":"343","author":"W Belkouche","year":"2020","unstructured":"Belkouche, W., Boussa\u00efri, A., Lakhlifi, S., Zaidi, M.: Matricial characterization of tournaments with maximum number of diamonds. Discrete Math. 343(4), 111699 (2020)","journal-title":"Discrete Math."},{"issue":"2","key":"2916_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.crma.2003.11.018","volume":"338","author":"H Bouchaala","year":"2004","unstructured":"Bouchaala, H.: Sur la r\u00e9partition des diamants dans un tournoi. C. R. Math. 338(2), 109\u2013112 (2004)","journal-title":"C. R. Math."},{"issue":"1","key":"2916_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0012-365X(03)00244-9","volume":"277","author":"A Boussa\u00efri","year":"2004","unstructured":"Boussa\u00efri, A., Ille, P., Lopez, G., Thomass\u00e9, S.: The $$c_3$$-structure of the tournaments. Discrete Math. 277(1), 29\u201343 (2004)","journal-title":"Discrete Math."},{"issue":"3","key":"2916_CR5","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/0097-3165(72)90098-2","volume":"12","author":"E Brown","year":"1972","unstructured":"Brown, E., Reid, K.B.: Doubly regular tournaments are equivalent to skew hadamard matrices. J. Comb. Theory A 12(3), 332\u2013338 (1972)","journal-title":"J. Comb. Theory A"},{"key":"2916_CR6","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541","volume-title":"CRC Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn, C.J., Dinitz, J.H.: CRC Handbook of Combinatorial Designs, 2nd edn. Chapman and Hall\/CRC, Boca Raton (2006)","edition":"2"},{"issue":"51\u201357","key":"2916_CR7","first-page":"51","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Simonovits, M.: A limit theorem in graph theory. Stud. Sci. Math. Hung. 1(51\u201357), 51 (1966)","journal-title":"Stud. Sci. Math. Hung."},{"key":"2916_CR8","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P Erd\u0151s","year":"1946","unstructured":"Erd\u0151s, P., Stone, A.H.: On the structure of linear graphs. Bull. Am. Math. Soc. 52, 1089\u20131091 (1946)","journal-title":"Bull. Am. Math. Soc."},{"key":"2916_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0012-365X(84)90058-X","volume":"50","author":"P Frankl","year":"1984","unstructured":"Frankl, P., F\u00fcredi, Z.: An exact result for 3-graphs. Discrete Math. 50, 323\u2013328 (1984)","journal-title":"Discrete Math."},{"key":"2916_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2017.04.001","volume":"126","author":"K Gunderson","year":"2017","unstructured":"Gunderson, K., Semeraro, J.: Tournaments, 4-uniform hypergraphs, and an exact extremal result. J. Comb. Theory B 126, 114\u2013136 (2017)","journal-title":"J. Comb. Theory B"},{"issue":"13","key":"2916_CR11","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1016\/j.disc.2006.06.037","volume":"308","author":"C Koukouvinos","year":"2008","unstructured":"Koukouvinos, C., Stylianou, S.: On skew-hadamard matrices. Discrete Math. 308(13), 2723\u20132731 (2008)","journal-title":"Discrete Math."},{"issue":"3","key":"2916_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1002\/jgt.21996","volume":"83","author":"N Linial","year":"2016","unstructured":"Linial, N., Morgenstern, A.: On the number of 4-cycles in a tournament. J. Graph Theory 83(3), 266\u2013276 (2016)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2916_CR13","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1111\/j.1749-6632.1989.tb16430.x","volume":"576","author":"KB Reid","year":"1989","unstructured":"Reid, K.B.: Three problems on tournaments. Ann. N. Y. Acad. Sci. 576(1), 466\u2013473 (1989)","journal-title":"Ann. N. Y. Acad. Sci."},{"key":"2916_CR14","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"issue":"1","key":"2916_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(71)90064-5","volume":"10","author":"J Wallis","year":"1971","unstructured":"Wallis, J.: Some (1,- 1) matrices. J. Comb. Theory B 10(1), 1\u201311 (1971)","journal-title":"J. Comb. Theory B"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02916-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02916-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02916-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T06:17:05Z","timestamp":1746253025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02916-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,27]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2916"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02916-7","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,3,27]]},"assertion":[{"value":"6 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"52"}}