{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:14:30Z","timestamp":1769976870330,"version":"3.49.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T00:00:00Z","timestamp":1466121600000},"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":["Combinatorica"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s00493-015-2662-5","type":"journal-article","created":{"date-parts":[[2016,6,17]],"date-time":"2016-06-17T10:45:02Z","timestamp":1466160302000},"page":"49-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Counting flags in triangle-free digraphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Jan","family":"Hladk\u00fd","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Norin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,17]]},"reference":[{"key":"2662_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0963548310000222","volume":"20","author":"R. Baber","year":"2011","unstructured":"R. Baber and J. Talbot: Hypergraphs do jump, Combin. Probab. Comput.\n20 (2011), 161\u2013171.","journal-title":"Combin. Probab. Comput."},{"key":"2662_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0012-365X(96)00162-8","volume":"165\/166","author":"J. A. Bondy","year":"1997","unstructured":"J. A. Bondy: Counting subgraphs: a new approach to the Caccetta-H\u00e4ggkvist conjecture, Discrete Math.\n165\/166 (1997), 71\u201380.","journal-title":"Discrete Math."},{"key":"2662_CR3","volume-title":"Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1978)","author":"L. Caccetta","year":"1978","unstructured":"L. Caccetta and R. H\u00e4ggkvist: On minimal digraphs with given girth, in: Proceedings of the Ninth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida Atlantic Univ., Boca Raton, Fla., 1978), Congress. Numer., XXI, 181-187, Winnipeg, Man., 1978. Utilitas Math."},{"key":"2662_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-008-2331-z","volume":"28","author":"M. Chudnovsky","year":"2008","unstructured":"M. Chudnovsky, P. Seymour and B. Sullivan: Cycles in dense digraphs, Combinatorica\n28 (2008), 1\u201318.","journal-title":"Combinatorica"},{"key":"2662_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/j.jctb.2013.05.002","volume":"103","author":"J. Cummings","year":"2013","unstructured":"J. Cummings, D. Kr\u00e1l\u2019, F. Pfender, K. Sperfeld, A. Treglown and M. Young: Monochromatic triangles in three-coloured graphs, J. Combin. Theory Ser. B\n103 (2013), 489\u2013503.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2662_CR6","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.jctb.2013.02.003","volume":"103","author":"S. Das","year":"2013","unstructured":"S. Das, H. Huang, J. Ma, H. Naves and B. Sudakov: A problem of Erd\u0151s on the minimum number of k-cliques, J. Combin. Theory Ser. B\n103 (2013), 344\u2013373.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2662_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00493-011-2589-4","volume":"31","author":"M. Dunkum","year":"2011","unstructured":"M. Dunkum, P. Hamburger and A. P\u00f3r: Destroying cycles in digraphs, Combinatorica\n31 (2011), 55\u201366.","journal-title":"Combinatorica"},{"key":"2662_CR8","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1016\/j.jctb.2012.04.001","volume":"102","author":"A. Grzesik","year":"2012","unstructured":"A. Grzesik: On the maximum number of five-cycles in a triangle-free graph, J. Combin. Theory Ser. B\n102 (2012), 1061\u20131066.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2662_CR9","volume-title":"Electron. J. Combin.","author":"P. Hamburger","year":"2007","unstructured":"P. Hamburger, P. Haxell and A. Kostochka: On directed triangles in digraphs, Electron. J. Combin.\n14 Note 19, (electronic), 2007."},{"key":"2662_CR10","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1017\/S0963548312000107","volume":"21","author":"H. Hatami","year":"2012","unstructured":"H. Hatami, J. Hladk\u00fd, D. Kr\u00e1l\u2019, S. Norine and A. Razborov: Non-threecolorable common graphs exist, Combin. Probab. Comput.\n21 (2012), 734\u2013742.","journal-title":"Combin. Probab. Comput."},{"key":"2662_CR11","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1016\/j.jcta.2012.12.008","volume":"120","author":"H. Hatami","year":"2013","unstructured":"H. Hatami, J. Hladk\u00fd, D. Kr\u00e1l\u2019, S. Norine and A. Razborov: On the number of pentagons in triangle-free graphs, J. Combin. Theory Ser. A\n120 (2013), 722\u2013732.","journal-title":"J. Combin. Theory Ser. A"},{"key":"2662_CR12","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1090\/S0894-0347-2010-00687-X","volume":"24","author":"H. Hatami","year":"2011","unstructured":"H. Hatami and S. Norine: Undecidability of linear inequalities in graph homomorphism densities, J. Amer. Math. Soc.\n24 (2011), 547\u2013565.","journal-title":"J. Amer. Math. Soc."},{"key":"2662_CR13","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1017\/S0963548312000612","volume":"22","author":"D. Kr\u00e1l\u2019","year":"2013","unstructured":"D. Kr\u00e1l\u2019, C.-H. Liu, J.-S. Sereni, P. Whalen and Z. B. Yilma: A new bound for the 2=3 conjecture, Combin. Probab. Comput.\n22 (2013), 384\u2013393.","journal-title":"Combin. Probab. Comput."},{"key":"2662_CR14","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1016\/j.jctb.2006.05.002","volume":"96","author":"L. Lov\u00e1sz","year":"2006","unstructured":"L. Lov\u00e1sz and B. Szegedy: Limits of dense graph sequences, J. Combin. Theory Ser. B\n96 (2006), 933\u2013957.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2662_CR15","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1002\/jgt.20611","volume":"70","author":"L. Lov\u00e1sz","year":"2012","unstructured":"L. Lov\u00e1sz and B. Szegedy: Random graphons and a weak Positivstellensatz for graphs, J. Graph Theory\n70 (2012), 214\u2013225.","journal-title":"J. Graph Theory"},{"key":"2662_CR16","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1017\/S0963548313000357","volume":"22","author":"O. Pikhurko","year":"2013","unstructured":"O. Pikhurko and E. R. Vaughan: Minimum number of k-cliques in graphs with bounded independence number, Combin. Probab. Comput.\n22 (2013), 910\u2013934.","journal-title":"Combin. Probab. Comput."},{"key":"2662_CR17","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.2178\/jsl\/1203350785","volume":"72","author":"A. A. Razborov","year":"2007","unstructured":"A. A. Razborov: Flag algebras, J. Symbolic Logic\n72 (2007), 1239\u20131282.","journal-title":"J. Symbolic Logic"},{"key":"2662_CR18","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1017\/S0963548308009085","volume":"17","author":"A. A. Razborov","year":"2008","unstructured":"A. A. Razborov: On the minimal density of triangles in graphs, Combin. Probab. Comput.\n17 (2008), 603\u2013618.","journal-title":"Combin. Probab. Comput."},{"key":"2662_CR19","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/090747476","volume":"24","author":"A. A. Razborov","year":"2010","unstructured":"A. A. Razborov: On 3-hypergraphs with forbidden 4-vertex configurations, SIAM J. Discrete Math.\n24 (2010), 946\u2013963.","journal-title":"SIAM J. Discrete Math."},{"key":"2662_CR20","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1002\/jgt.21707","volume":"74","author":"A. A. Razborov","year":"2013","unstructured":"A. A. Razborov: On the Caccetta-H\u00e4ggkvist conjecture with forbidden subgraphs, J. Graph Theory\n74 (2013), 236\u2013248.","journal-title":"J. Graph Theory"},{"key":"2662_CR21","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jctb.1998.1839","volume":"74","author":"J. Shen","year":"1998","unstructured":"J. Shen: Directed triangles in digraphs, J. Combin. Theory Ser. B\n74 (1998), 405\u2013407.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2662_CR22","volume-title":"A summary of results and problems related to the Caccetta-H\u00e4ggkvist conjecture","author":"B. Sullivan","year":"2006","unstructured":"B. Sullivan: A summary of results and problems related to the Caccetta-H\u00e4ggkvist conjecture, unpublished, 2006."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2662-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-015-2662-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2662-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-015-2662-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,4,22]],"date-time":"2017-04-22T03:12:05Z","timestamp":1492830725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-015-2662-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,17]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["2662"],"URL":"https:\/\/doi.org\/10.1007\/s00493-015-2662-5","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,17]]}}}