{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T06:20:11Z","timestamp":1771482011526,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7412,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,4]]},"DOI":"10.1016\/0012-365x(93)90366-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"199-203","source":"Crossref","is-referenced-by-count":20,"title":["2-Colorings of complete graphs with a small number of monochromatic K4 subgraphs"],"prefix":"10.1016","volume":"114","author":[{"given":"F.","family":"Franek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"R\u00f6dl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90366-2_BIB1","first-page":"459","article-title":"On the number of complete subgraphs contained in certain graphs","volume":"VII","author":"Erdős","year":"1962","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"10.1016\/0012-365X(93)90366-2_BIB2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.4153\/CMB-1964-003-8","article-title":"On subgraphs on the complete bipartite graph","volume":"7","author":"Erdős","year":"1964","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(93)90366-2_BIB3","series-title":"Tech. Report","article-title":"Disproving Erdős's conjecture on multiplicities of complete subgraphs using computer","author":"Franek","year":"1988"},{"key":"10.1016\/0012-365X(93)90366-2_BIB4","series-title":"Tech. Report","article-title":"Erdős's conjecture on multiplicities of complete subgraphs in locally true","author":"Franek","year":"1988"},{"key":"10.1016\/0012-365X(93)90366-2_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/BF02351585","article-title":"Ramsey problem on multiplicities of complete subgraphs in nearly quasi-random graphs","volume":"8","author":"Franek","year":"1992","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(93)90366-2_BIB6","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0095-8956(88)90040-8","article-title":"The number of submatrices of given type in a Hadamard matrix and related results","volume":"44","author":"Frankl","year":"1988","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(93)90366-2_BIB7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0095-8956(79)90016-9","article-title":"Sur le probleme de Goodman pour les quadrangles et la majoration des nombres de Ramsey","volume":"30","author":"Giraud","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90366-2_BIB8","doi-asserted-by":"crossref","first-page":"778","DOI":"10.2307\/2310464","article-title":"On sets of acquaintances and strangers at any party","volume":"66","author":"Goodman","year":"1959","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0012-365X(93)90366-2_BIB9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","article-title":"A constructive solution to a tournament problem","volume":"14","author":"Graham","year":"1971","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/0012-365X(93)90366-2_BIB10","unstructured":"A.F. Sidorenko, Cycles in graphs and functional inequalities, manuscript in Russian, and also private communication."},{"issue":"2","key":"10.1016\/0012-365X(93)90366-2_BIB11","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1112\/jlms\/s2-39.2.246","article-title":"A disproof of a conjecture of Erdős in Ramsey theory","volume":"39","author":"Thomason","year":"1989","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(93)90366-2_BIB12","article-title":"Pseudo-random graphs","volume":"Vol. 33","author":"Thomason","year":"1987"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93903662?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X93903662?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:01Z","timestamp":1555120381000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X93903662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0012365X93903662"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90366-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}