{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:06:49Z","timestamp":1648588009793},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,3,1]],"date-time":"1993-03-01T00:00:00Z","timestamp":730944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1993,3]]},"DOI":"10.1007\/bf01202793","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T15:51:34Z","timestamp":1108741894000},"page":"109-120","source":"Crossref","is-referenced-by-count":13,"title":["Boundedness of optimal matrices in extremal multigraph and digraph problems"],"prefix":"10.1007","volume":"13","author":[{"given":"Alexander","family":"Sidorenko","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0095-8956(73)90034-8","volume":"15","author":"W. G. Brown","year":"1973","unstructured":"W. G. Brown, P. Erd?s, andM. Simonovits: Extremal problems for directed graphs,J. Combin. Theory B15 (1973), 77?93.","journal-title":"J. Combin. Theory B"},{"key":"CR2","series-title":"Colloq. Math. Soc. J\ufffdnos Bolyai","first-page":"119","volume-title":"Inverse extremal problems","author":"W. G. Brown","year":"1985","unstructured":"W. G. Brown, P. Erd?s, andM. Simonovits: Inverse extremal problems,Colloq. Math. Soc. J\ufffdnos Bolyai 37, finity and Infinite Sets, Akad. Kiad\ufffd, Budapest, 1985, 119?156."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1090\/S0002-9947-1985-0808730-0","volume":"292","author":"W. G. Brown","year":"1985","unstructured":"W. G. Brown, P. Erd?s, andM. Simonovits: Algorithmic solution of extremal digraph problemsTrans. of Amer. Math. Soc. 292 (1985) 421?449.","journal-title":"Trans. of Amer. Math. Soc."},{"key":"CR4","first-page":"125","volume":"9","author":"P. Erd?s","year":"1964","unstructured":"P. Erd?s, andL. Moser: On the representation of directed graphs as unions of orederings,Publ. Math. Inst. Hungar. Acad. Sci. 9 (1964), 125?132.","journal-title":"Publ. Math. Inst. Hungar. Acad. Sci."},{"key":"CR5","first-page":"51","volume":"1","author":"P. Erd?s","year":"1966","unstructured":"P. Erd?s, andM. Simonovits: A limit theorem in graph theory,Studia Sci. Math. Hungar. 1 (1966), 51?57.","journal-title":"Studia Sci. Math. Hungar."},{"key":"CR6","first-page":"228","volume":"15","author":"G. Katona","year":"1964","unstructured":"G. Katona, T. Nemetz, andM. Simonovits: On a graph problem of Tur\ufffdn, (in Hungarian),Mat. Lapok 15 (1964), 228?238.","journal-title":"Mat. Lapok"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0021-9800(70)80061-8","volume":"9","author":"K. B. Reid","year":"1970","unstructured":"K. B. Reid, andE. T. Parker: Disproof of a conjecture of Erd?s and Moser on tournaments,J. Combin. Theory 9 (1970), 225?238.","journal-title":"J. Combin. Theory"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1090\/S0002-9947-1938-1501980-0","volume":"44","author":"I. J. Schoenberg","year":"1938","unstructured":"I. J. Schoenberg: Metric spaces and positive definite functions,Trans. of Amer. Math. Soc. 44 (1938), 522?536.","journal-title":"Trans. of Amer. Math. Soc."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01158259","volume":"41","author":"A. F. Sidorenko","year":"1987","unstructured":"A. F. Sidorenko: On the maximal number of edges in a uniform hypergraph that does not contain prohibited subgraphs,Math. Notes 41 (1987), 247?259.","journal-title":"Math. Notes"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/rsa.3240020107","volume":"2","author":"A. F. Sidorenko","year":"1992","unstructured":"A. F. Sidorenko: Inequalities in probability theory and Tur\ufffdn-type problems for graphs with colored vertices,Random Structures and Algorithms 2 (1992), 73?99.","journal-title":"Random Structures and Algorithms"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202793.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202793\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202793","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:01:56Z","timestamp":1556730116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,3]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,3]]}},"alternative-id":["BF01202793"],"URL":"https:\/\/doi.org\/10.1007\/bf01202793","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,3]]}}}