{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T15:17:16Z","timestamp":1688138236757},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,6,19]],"date-time":"2012-06-19T00:00:00Z","timestamp":1340064000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00373-012-1199-2","type":"journal-article","created":{"date-parts":[[2012,6,18]],"date-time":"2012-06-18T15:11:11Z","timestamp":1340032271000},"page":"1269-1286","source":"Crossref","is-referenced-by-count":2,"title":["On Minimum Saturated Matrices"],"prefix":"10.1007","volume":"29","author":[{"given":"Andrzej","family":"Dudek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Pikhurko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Thomason","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,19]]},"reference":[{"key":"1199_CR1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/0195-6698(95)90000-4","volume":"16","author":"R.P. Anstee","year":"1995","unstructured":"Anstee R.P.: Forbidden configurations: Induction and linear algebra. Europ. J. Combin. 16, 427\u2013438 (1995)","journal-title":"Europ. J. Combin."},{"key":"1199_CR2","unstructured":"Anstee, R.P.: A survey of forbidden configuration results (2010). Manuscript"},{"key":"1199_CR3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(86)90211-6","volume":"62","author":"R.P. Anstee","year":"1986","unstructured":"Anstee R.P., F\u00fcredi Z.: Forbidden submatrices. Discrete Math. 62, 225\u2013243 (1986)","journal-title":"Discrete Math."},{"key":"1199_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF03352989","volume":"13","author":"R.P. Anstee","year":"1997","unstructured":"Anstee R.P., Griggs J.R., Sali A.: Small forbidden configurations. Graphs Combin. 13, 97\u2013118 (1997)","journal-title":"Graphs Combin."},{"issue":"5","key":"1199_CR5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s00493-005-0031-5","volume":"25","author":"R.P. Anstee","year":"2005","unstructured":"Anstee R.P., Sali A.: Small forbidden configurations IV: the 3 rowed case. Combinatorica 25(5), 503\u2013518 (2005)","journal-title":"Combinatorica"},{"key":"1199_CR6","volume-title":"Combinatorics, Set Systems, Families of Vectors, and Combinatorial Probability","author":"B. Bollob\u00e1s","year":"1986","unstructured":"Bollob\u00e1s B.: Combinatorics, Set Systems, Families of Vectors, and Combinatorial Probability. Cambridge University Press, Cambridge (1986)"},{"key":"1199_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0095-8956(72)90025-1","volume":"12","author":"J.A. Bondy","year":"1972","unstructured":"Bondy J.A.: Induced subsets. J. Combin. Theory (B) 12, 201\u2013202 (1972)","journal-title":"J. Combin. Theory (B)"},{"key":"1199_CR8","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1214\/aoms\/1177729958","volume":"20","author":"R.C. Bose","year":"1949","unstructured":"Bose R.C.: A note on Fisher\u2019s inequality for balanced incomplete block designs. Ann. Math. Statist. 20, 619\u2013620 (1949)","journal-title":"Ann. Math. Statist."},{"key":"1199_CR9","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs, second edn. Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"1199_CR10","unstructured":"Dudek, A., Pikhurko, O., Thomason, A.: On minimum saturated matrices (2009). E-print arxiv.org:0909.1970"},{"key":"1199_CR11","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.2307\/2311408","volume":"71","author":"P. Erd\u0151s","year":"1964","unstructured":"Erd\u0151s P., Hajnal A., Moon J.W.: A problem in graph theory. Amer. Math. Monthly. 71, 1107\u20131110 (1964)","journal-title":"Amer. Math. Monthly."},{"key":"1199_CR12","first-page":"36","volume":"DS19","author":"J. Faudree","year":"2011","unstructured":"Faudree J., Faudree R., Schmitt J.: A survey of minimum saturated graphs and hypergraphs. Elect. J. Combin. DS19, 36 (2011)","journal-title":"Elect. J. Combin."},{"key":"1199_CR13","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1111\/j.1469-1809.1940.tb02237.x","volume":"10","author":"R.A. Fisher","year":"1940","unstructured":"Fisher R.A.: An examination of the possible different solutions of a problem in incomplete blocks. Ann. Eugenics (London) 10, 52\u201375 (1940)","journal-title":"Ann. Eugenics (London)"},{"key":"1199_CR14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01788556","volume":"3","author":"P. Frankl","year":"1987","unstructured":"Frankl P., F\u00fcredi Z., Pach J.: Bounding one-way differences. Graphs Combin. 3, 341\u2013347 (1987)","journal-title":"Graphs Combin."},{"key":"1199_CR15","doi-asserted-by":"crossref","unstructured":"F\u00fcredi, Z.: Tur\u00e1n type problems. In: Surveys in Combinatorics, London Math. Soc. Lecture Notes Ser., vol. 166, pp. 253\u2013300. Cambridge University Press, Cambridge (1991)","DOI":"10.1017\/CBO9780511666216.010"},{"key":"1199_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal Combinatorics with Applications to Computer Science","author":"S. Jukna","year":"2001","unstructured":"Jukna S.: Extremal Combinatorics with Applications to Computer Science. Springer, Berlin (2001)"},{"key":"1199_CR17","first-page":"83","volume-title":"Surveys in Combinatorics.","author":"P. Keevash","year":"2011","unstructured":"Keevash P.: Hypergraph Tur\u00e1n problem. In: Chapman, R. (ed.) Surveys in Combinatorics., pp. 83\u2013140. Cambridge University Press, Cambridge (2011)"},{"key":"1199_CR18","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/S0963548399003971","volume":"8","author":"O. Pikhurko","year":"1999","unstructured":"Pikhurko O.: The minimum size of saturated hypergraphs. Combin. Prob. Computing 8, 483\u2013492 (1999)","journal-title":"Combin. Prob. Computing"},{"key":"1199_CR19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0097-3165(72)90019-2","volume":"13","author":"N. Sauer","year":"1973","unstructured":"Sauer N.: On the density of families of sets. J. Combin. Theory (A) 13, 145\u2013147 (1973)","journal-title":"J. Combin. Theory (A)"},{"key":"1199_CR20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.2140\/pjm.1972.41.247","volume":"4","author":"S. Shelah","year":"1972","unstructured":"Shelah S.: A combinatorial problem: Stability and order for models and theories in infinitary languages. Pac. J. Math. 4, 247\u2013261 (1972)","journal-title":"Pac. J. Math."},{"key":"1199_CR21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF01929486","volume":"11","author":"A. Sidorenko","year":"1995","unstructured":"Sidorenko A.: What we know and what we do not know about Tur\u00e1n numbers. Graphs Combin. 11, 179\u2013199 (1995)","journal-title":"Graphs Combin."},{"key":"1199_CR22","first-page":"264","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik V.N., Chervonenkis A.: The uniform convergence of frequences of the appearance of events to their probabilities (in Russian). Teor. Veroyatn. Primen. 16, 264\u2013279 (1971)","journal-title":"Teor. Veroyatn. Primen."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1199-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1199-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1199-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T02:43:08Z","timestamp":1561862588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1199-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,19]]},"references-count":22,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1199"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1199-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,19]]}}}