{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T15:53:15Z","timestamp":1771861995177,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"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":[[2012,3]]},"DOI":"10.1007\/s00493-012-2657-4","type":"journal-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T18:48:05Z","timestamp":1338922085000},"page":"143-169","source":"Crossref","is-referenced-by-count":12,"title":["Almost all triangle-free triple systems are tripartite"],"prefix":"10.1007","volume":"32","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhruv","family":"Mubayi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,6]]},"reference":[{"key":"2657_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jctb.2003.08.001","volume":"91","author":"J. Balogh","year":"2004","unstructured":"J. Balogh, B. Bollob\u00e1s and M. Simonovits: On the number of graphs without Forbidden subgraph, J. Combin. Theory Ser. B 91 (2004), 1\u201324.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2657_CR2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/rsa.20242","volume":"34","author":"J. Balogh","year":"2009","unstructured":"J. Balogh, B. Bollob\u00e1s and M. Simonovits: The typical structure of graphs without given excluded subgraphs, Random Structures and Algorithms 34 (2009), 305\u2013318.","journal-title":"Random Structures and Algorithms"},{"issue":"2","key":"2657_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.jctb.2010.11.001","volume":"101","author":"J. Balogh","year":"2011","unstructured":"J. Balogh, B. Bollob\u00e1s and M. Simonovits: The fine structure of octahedron-free graphs, J. Combin. Theory, Ser. B 101(2) (2011), 67\u201384.","journal-title":"J. Combin. Theory, Ser. B"},{"issue":"1\u20132","key":"2657_CR4","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1002\/rsa.20353","volume":"38","author":"J. Balogh","year":"2011","unstructured":"J. Balogh and J. Butterfield: Excluding induced subgraphs: Critical graphs; Random Structures and Algorithms 38(1\u20132) (2011), 100\u2013120.","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"2657_CR5","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1016\/j.jcta.2011.01.006","volume":"118","author":"J. Balogh","year":"2011","unstructured":"J. Balogh and D. Mubayi: Almost all triple systems with independent neighborhoods are semi-bipartite, J. Combin. Theory, Ser. A 118(4) (2011), 1494\u20131518.","journal-title":"J. Combin. Theory, Ser. A"},{"key":"2657_CR6","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1112\/jlms\/jdq086","volume":"83","author":"J. Balogh","year":"2011","unstructured":"J. Balogh and W. Samotij: The number of Ks,t-free graphs, Journal of the London Mathematical Society 83 (2011), 368\u2013388.","journal-title":"Journal of the London Mathematical Society"},{"key":"2657_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(74)90105-8","volume":"8","author":"B. Bollob\u00e1s","year":"1974","unstructured":"B. Bollob\u00e1s: Three-graphs without two triples whose symmetric difference is contained in a third, Discrete Math. 8 (1974), 21\u201324.","journal-title":"Discrete Math."},{"key":"2657_CR8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1112\/blms\/27.5.417","volume":"27","author":"B. Bollob\u00e1s","year":"1995","unstructured":"B. Bollob\u00e1s and A. Thomason: Projections of bodies and hereditary properties of hypergraphs, Bull. London Math. Soc. 27 (1995), 417\u2013424.","journal-title":"Bull. London Math. Soc."},{"key":"2657_CR9","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.jctb.2008.09.004","volume":"99","author":"R. Dotson","year":"2009","unstructured":"R. Dotson and N. Brendan: Hereditary properties of hypergraphs, J. Combin. Theory, Ser. B 99 (2009), 460\u2013473.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"2657_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01788085","volume":"2","author":"P. Erd\u0151s","year":"1986","unstructured":"P. Erd\u0151s, P. Frankl and V. R\u00f6dl: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs and Combin. 2 (1986), 113\u2013121.","journal-title":"Graphs and Combin."},{"key":"2657_CR11","unstructured":"P. Erd\u0151s, D. J. Kleitman and B. L. Rothschild: Asymptotic enumeration of K n-free graphs, in Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Vol. II, 19\u201327. Atti dei Convegni Lincei, 17, Accad. Naz. Lincei, Rome, 1976."},{"issue":"3\u20134","key":"2657_CR12","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF02579190","volume":"3","author":"P. Frankl","year":"1983","unstructured":"P. Frankl and Z. F\u00fcredi: A new generalization of the Erd\u0151s-Ko-Rado theorem, Combinatorica 3(3\u20134) (1983), 341\u2013349.","journal-title":"Combinatorica"},{"issue":"2","key":"2657_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/rsa.10017","volume":"20","author":"P. Frankl","year":"2002","unstructured":"P. Frankl and V. R\u00f6dl: Extremal problems on set systems, Random Structures and Algorithms 20(2) (2002), 131\u2013164.","journal-title":"Random Structures and Algorithms"},{"key":"2657_CR14","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1017\/S0963548305006784","volume":"14","author":"Z. F\u00fcredi","year":"2005","unstructured":"Z. F\u00fcredi and M. Simonovits: Triple systems not containing a Fano configuration, Combinatorics, Probabality and Computing 14 (2005), 467\u2013484.","journal-title":"Combinatorics, Probabality and Computing"},{"key":"2657_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.jctb.2004.05.003","volume":"92","author":"P. Keevash","year":"2004","unstructured":"P. Keevash and D. Mubayi: Stability results for cancellative hypergraphs, J. Combin. Theory, Ser. B 92 (2004), 163\u2013175.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"2657_CR16","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1007\/s00493-005-0034-2","volume":"255","author":"P. Keevash","year":"2005","unstructured":"P. Keevash and B. Sudakov: The Tur\u00e1n number of the Fano plane, Combinatorica 25(5) (2005), 561\u2013574.","journal-title":"Combinatorica"},{"key":"2657_CR17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2009.05.005","volume":"1002","author":"Y. Kohayakawa","year":"2010","unstructured":"Y. Kohayakawa, B. Nagle, V. R\u00f6dl and M. Schacht: Weak hypergraph regularity and linear hypergraphs, J. Combin. Theory, Ser. B 100(2) (2010), 151\u2013160.","journal-title":"J. Combin. Theory, Ser. B"},{"key":"2657_CR18","first-page":"637","volume":"303","author":"Ph. G. Kolaitis","year":"1987","unstructured":"Ph. G. Kolaitis, H. J. Pr\u00f6mel and B. L. Rothschild: K l+1-free graphs: asymptotic structure and a 0-1 law, Trans. Amer. Math. Soc. 303 (1987), 637\u2013671.","journal-title":"Trans. Amer. Math. Soc."},{"key":"2657_CR19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0012-365X(00)00280-6","volume":"235","author":"B. Nagle","year":"2001","unstructured":"B. Nagle and V. R\u00f6dl: The asymptotic number of 3-graphs not containing a fixed one, Discrete Math. 235 (2001), 271\u2013290.","journal-title":"Discrete Math."},{"key":"2657_CR20","first-page":"247","volume-title":"Extremal hypergraph problems and the regularity method","author":"B. Nagle","year":"2006","unstructured":"B. Nagle, V. R\u00f6dl and M. Schacht: Extremal hypergraph problems and the regularity method, Topics in Discrete Mathematics, Algorithms Combin. vol. 26, Springer, Berlin (2006), 247\u2013278."},{"key":"2657_CR21","unstructured":"Y. Person and M. Schacht: Almost all hypergraphs without Fano planes are bipartite, in: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (C. Mathieu, ed.), (SODA 09), 217\u2013226. ACM Press."},{"key":"2657_CR22","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01305238","volume":"124","author":"H. J. Pr\u00f6mel","year":"1992","unstructured":"H. J. Pr\u00f6mel and A. Steger: The asymptotic number of graphs not containing a fixed color-critical subgraph, Combinatorica 12(4) (1992), 463\u2013473.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2657-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2657-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2657-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:48Z","timestamp":1559093568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2657-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["2657"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2657-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}