{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T21:05:43Z","timestamp":1775163943525,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00493-020-4371-y","type":"journal-article","created":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T17:05:53Z","timestamp":1612199153000},"page":"175-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Tournament Quasirandomness from Local Counting"],"prefix":"10.1007","volume":"41","author":[{"given":"Matija","family":"Buci\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eoin","family":"Long","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Shapira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benny","family":"Sudakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,1]]},"reference":[{"key":"4371_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/rsa.1010","volume":"18","author":"I Adler","year":"2001","unstructured":"I. Adler, N. Alon and S. M. Ross: On the maximum number of Hamiltonian paths in tournaments, Random Structures Algorithms 18 (2001), 291\u2013296.","journal-title":"Random Structures Algorithms"},{"key":"4371_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jalgor.2003.09.003","volume":"50","author":"N Alon","year":"2004","unstructured":"N. Alon, G. Gutin and M. Krivelevich: Algorithms with large domination ratio, Journal of Algorithms 50 (2004), 118\u2013131.","journal-title":"Journal of Algorithms"},{"key":"4371_CR3","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/j.jcss.2004.04.008","volume":"69","author":"N Alon","year":"2004","unstructured":"N. Alon and A. Shapira: Testing subgraphs of directed graphs, J. Comput. System Sci., 69 (2004), 353\u2013382.","journal-title":"J. Comput. System Sci."},{"key":"4371_CR4","unstructured":"N. Alon and J. H. Spencer: The probabilistic method, Wiley, 4th ed., 2016."},{"key":"4371_CR5","doi-asserted-by":"crossref","unstructured":"S. Basu, R. Pollack and M.-F. Roy: Algorithms in real algebraic geometry, Springer, 2nd ed., 2006.","DOI":"10.1007\/3-540-33099-2"},{"key":"4371_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/jgt.3190150206","volume":"15","author":"F Chung","year":"1991","unstructured":"F. Chung and R. L. Graham: Quasi-random tournaments, J. Graph Theory 15 (1991), 173\u2013198.","journal-title":"J. Graph Theory"},{"key":"4371_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1090\/S0894-0347-1991-1077279-1","volume":"4","author":"F Chung","year":"1991","unstructured":"F. Chung and R. L. Graham: Quasi-random set systems, J. Amer. Math. Soc. 4 (1991), 151\u2013196.","journal-title":"J. Amer. Math. Soc."},{"key":"4371_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02125347","volume":"9","author":"F Chung","year":"1989","unstructured":"F. Chung, R. L. Graham and R. M. Wilson: Quasi-random graphs, Combinatorica 9 (1989), 345\u2013362.","journal-title":"Combinatorica"},{"key":"4371_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1017\/S0305004116001055","volume":"164","author":"D Conlon","year":"2018","unstructured":"D. Conlon, J. Fox and B. Sudakov: Hereditary quasirandomness without regularity, Math. Proc. Cambridge Philos. Soc. 164 (2018), 385\u2013399.","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"4371_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20389","volume":"40","author":"D Conlon","year":"2012","unstructured":"D. Conlon, H. H\u00e0n, Y. Person and M. Schacht: Weak quasi-randomness for uniform hypergraphs, Random Structures Algorithms 40 (2012), 1\u201338.","journal-title":"Random Structures Algorithms"},{"key":"4371_CR11","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.jcta.2004.01.006","volume":"106","author":"J N Cooper","year":"2004","unstructured":"J. N. Cooper: Quasirandom permutations, J. Combin. Theory Ser. A 106 (2004), 123\u2013143.","journal-title":"J. Combin. Theory Ser. A"},{"key":"4371_CR12","doi-asserted-by":"crossref","unstructured":"L. N. Coregliano, R. F. Parente and C. M. Sato: On the maximum density of fixed strongly connected subtournaments, Electron. J. Combin. 26 (2019), no. 1, paper 1.44.","DOI":"10.37236\/6557"},{"issue":"1","key":"4371_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1002\/jgt.22044","volume":"85","author":"L N Coregliano","year":"2017","unstructured":"L. N. Coregliano and A. A. Razborov: On the density of transitive tournaments, J. Graph Theory 85(1), (2017) 12\u201321.","journal-title":"J. Graph Theory"},{"issue":"2","key":"4371_CR14","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00493-011-2621-8","volume":"31","author":"D Dellamonica Jr.","year":"2011","unstructured":"D. Dellamonica Jr. and V. R\u00f6dl: Hereditary quasirandom properties of hypergraphs, Combinatorica 31(2), (2011) 165\u2013182.","journal-title":"Combinatorica"},{"key":"4371_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02759942","volume":"2","author":"P Erd\u0151s","year":"1964","unstructured":"P. Erd\u0151s: On extremal problems of graphs and generalized graphs, Israel J. Math. 2, (1964), 183\u2013190.","journal-title":"Israel J. Math."},{"key":"4371_CR16","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0095-8956(83)90060-6","volume":"35","author":"W Fernandez de la Vega","year":"1983","unstructured":"W. Fernandez de la Vega: On the maximum cardinality of a consistent set of arcs in a random tournament, J. Combin. Theory Ser. B 35 (1983), 328\u2013332.","journal-title":"J. Combin. Theory Ser. B"},{"key":"4371_CR17","unstructured":"J. Fox, Z. Himwich and N. Mani: personal communication."},{"key":"4371_CR18","doi-asserted-by":"publisher","first-page":"897","DOI":"10.4007\/annals.2007.166.897","volume":"166","author":"W T Gowers","year":"2007","unstructured":"W. T. Gowers: Hypergraph regularity and the multidimensional Szemer\u00e9di theorem, Annal. Math. 166 (2007), 897\u2013946.","journal-title":"Annal. Math."},{"key":"4371_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1017\/S0963548307008826","volume":"17","author":"W T Gowers","year":"2008","unstructured":"W. T. Gowers: Quasirandom groups, Combin., Probab. Comput. 17 (2008), 363\u2013387.","journal-title":"Combin., Probab. Comput."},{"key":"4371_CR20","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1002\/jgt.21701","volume":"74","author":"S Griffiths","year":"2013","unstructured":"S. Griffiths: Quasi-random oriented graphs, J. Graph Theory 74 (2013), 198\u2013209.","journal-title":"J. Graph Theory"},{"key":"4371_CR21","unstructured":"T. Gustavsson: Decompositions of large graphs and digraphs with high minimum degree, PhD thesis, Univ. of Stockholm, (1991)."},{"key":"4371_CR22","unstructured":"R. Hancock, A. Kabela, D. Kr\u00e1L\u2019, T. Martins, R. Parente, F. Skerman, J. Volec: No additional tournaments are quasirandom-forcing, preprint arXiv:1912.04243."},{"key":"4371_CR23","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1002\/jgt.21671","volume":"73","author":"S Kalyanasundaram","year":"2013","unstructured":"S. Kalyanasundaram and A. Shapira: A Note on Even Cycles and Quasi-Random Tournaments, J. Graph Theory 73 (2013), 260\u2013266.","journal-title":"J. Graph Theory"},{"key":"4371_CR24","unstructured":"T. P. Kirkman: On a problem in combinations, The Cambridge and Dublin Mathematical Journal (Macmillan, Barclay, and Macmillan) II (1847), 191\u2013204."},{"key":"4371_CR25","first-page":"570","volume":"23","author":"D Kr\u00e1l\u2019","year":"2013","unstructured":"D. Kr\u00e1l\u2019 and O. Pikhurko: Quasirandom permutations are characterized by 4-point densities, GAFA 23 (2013), 570\u2013579.","journal-title":"GAFA"},{"key":"4371_CR26","doi-asserted-by":"crossref","unstructured":"M. Krivelevich and B. Sudakov: Pseudo-random graphs, in: More Sets, Graphs and Numbers, Bolyai Society Mathematical Studies 15, 199\u2013262. Springer, 2006.","DOI":"10.1007\/978-3-540-32439-3_10"},{"key":"4371_CR27","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz: Combinatorial problems and exercises, North-Holland Publishing Co., 2nd ed., 1993.","DOI":"10.1016\/B978-0-444-81504-0.50006-0"},{"key":"4371_CR28","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/rsa.20117","volume":"28","author":"B Nagle","year":"2006","unstructured":"B. Nagle, V. R\u00f6dl and M. Schacht: The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms 28 (2006), 113\u2013179.","journal-title":"Random Structures Algorithms"},{"key":"4371_CR29","doi-asserted-by":"crossref","unstructured":"R. O\u2019Donnell: Analysis of Boolean functions, Cambridge University Press, 2014.","DOI":"10.1017\/CBO9781139814782"},{"key":"4371_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/rsa.20017","volume":"25","author":"V R\u00f6dl","year":"2004","unstructured":"V. R\u00f6dl and J. Skokan: Regularity lemma for k-uniform hypergraphs, Random Structures Algorithms 25 (2004), 1\u201342.","journal-title":"Random Structures Algorithms"},{"key":"4371_CR31","unstructured":"M. Schacht: Regularity lemma and its applications, lecture notes, https:\/\/www.math.uni-hamburg.de\/home\/schacht\/lnotes\/GT\/SzRL.pdf"},{"key":"4371_CR32","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1017\/S0963548303005613","volume":"12","author":"M Simonovits","year":"2003","unstructured":"M. Simonovits and V. T. S\u00f3s: Hereditary extended properties, quasi-random graphs and induced subgraphs, Combin. Probab. Comput., 12 (2003), 319\u2013344.","journal-title":"Combin. Probab. Comput."},{"key":"4371_CR33","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/BF01195005","volume":"17","author":"M Simonovits","year":"1997","unstructured":"M. Simonovits and V. T. S\u00f3s: Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Combinatorica 17 (1997), 577\u2013596.","journal-title":"Combinatorica"},{"key":"4371_CR34","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.3230010204","volume":"1","author":"J Spencer","year":"1971","unstructured":"J. Spencer: Optimal ranking of tournaments, Networks 1 (1971), 135\u2013138.","journal-title":"Networks"},{"key":"4371_CR35","first-page":"399","volume":"260","author":"E Szemer\u00e9di","year":"1978","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, Probl\u00e8mes combinatoires et th\u00e9orie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), Colloq. Internat. CNRS 260 (1978), 399\u2013401.","journal-title":"Colloq. Internat. CNRS"},{"key":"4371_CR36","doi-asserted-by":"crossref","unstructured":"A. Thomason: Pseudo-random graphs, Proceedings of Random Graphs, Poznan 1985 (M. Karonski, ed.) Annals of Discrete Math. 33 (1987), 307\u2013331.","DOI":"10.1016\/S0304-0208(08)73063-9"},{"key":"4371_CR37","series-title":"LMS Lecture Notes Series","first-page":"173","volume-title":"Surveys in Combinatorics","author":"A Thomason","year":"1987","unstructured":"A. Thomason: Random graphs, strongly regular graphs and pseudo-random graphs, in Surveys in Combinatorics 1987 (C. Whitehead, ed.) LMS Lecture Notes Series 123, Cambridge Univ. Press, Cambridge, 173\u2013196."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4371-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-020-4371-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-020-4371-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T22:44:13Z","timestamp":1697755453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-020-4371-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,1]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["4371"],"URL":"https:\/\/doi.org\/10.1007\/s00493-020-4371-y","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,1]]},"assertion":[{"value":"26 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}