{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:38:20Z","timestamp":1783748300399,"version":"3.55.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,5,26]],"date-time":"2012-05-26T00:00:00Z","timestamp":1337990400000},"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-1195-6","type":"journal-article","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T08:32:16Z","timestamp":1337934736000},"page":"1355-1364","source":"Crossref","is-referenced-by-count":22,"title":["Saturating Sperner Families"],"prefix":"10.1007","volume":"29","author":[{"given":"D\u00e1niel","family":"Gerbner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bal\u00e1zs","family":"Keszegh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nathan","family":"Lemons","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cory","family":"Palmer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"D\u00f6m\u00f6t\u00f6r","family":"P\u00e1lv\u00f6lgyi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bal\u00e1zs","family":"Patk\u00f3s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,5,26]]},"reference":[{"key":"1195_CR1","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0097-3165(87)90036-7","volume":"44","author":"A. Blokhuis","year":"1987","unstructured":"Blokhuis A.: More on maximal intersecting families of finite sets. J. Combin. Theory Ser. A 44, 299\u2013303 (1987)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1195_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.4310\/JOC.2010.v1.n2.a5","volume":"1","author":"T. Bohman","year":"2010","unstructured":"Bohman T., Fonoberova M., Pikhurko O.: The saturation function of complete partite graphs. J. Combin. 1, 149\u2013170 (2010)","journal-title":"J. Combin."},{"key":"1195_CR3","first-page":"419","volume":"13","author":"B. Bollob\u00e1s","year":"1967","unstructured":"Bollob\u00e1s B.: Determination of extremal graphs by using weights. Wiss. Z. Hochsch. Ilmenau 13, 419\u2013421 (1967)","journal-title":"Wiss. Z. Hochsch. Ilmenau"},{"key":"1195_CR4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.2307\/2315614","volume":"74","author":"B. Bollob\u00e1s","year":"1967","unstructured":"Bollob\u00e1s B.: On a conjecture of Erd\u0151s, Hajnal and Moon. Am. Math. monthly 74, 178\u2013179 (1967)","journal-title":"Am. Math. monthly"},{"key":"1195_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/jgt.20372","volume":"61","author":"Y-C. Chen","year":"2009","unstructured":"Chen Y-C.: Minimum C 5-saturated graphs. J. Graph Theory 61, 111\u2013126 (2009)","journal-title":"J. Graph Theory"},{"key":"1195_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1002\/jgt.20508","volume":"67","author":"Y-C. Chen","year":"2011","unstructured":"Chen Y-C.: All minimum C 5-saturated graphs. J. Graph Theory 67, 9\u201326 (2011)","journal-title":"J. Graph Theory"},{"key":"1195_CR7","unstructured":"Chen, Y-C.: Minimum K 2,3-saturated graphs. arXiv:1012.4152 (2010)"},{"key":"1195_CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jcta.1998.2961","volume":"87","author":"F. Chung","year":"1999","unstructured":"Chung F., Lu L.: An upper bound for the Tur\u00e1n number t 3(n, 4). J. Combin. Theory Ser. A 87, 381\u2013389 (1999)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1195_CR9","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes, North-Holland Mathematical Library, vol. 54. North-Holland, Amsterdam (1997)"},{"key":"1195_CR10","unstructured":"Dudek, A., Pikhurko, O., Thomason, A.: On minimum saturated matrices. Graph. Combinator. (to appear)"},{"key":"1195_CR11","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1090\/S0002-9904-1945-08454-7","volume":"51","author":"P. Erd\u0151s","year":"1945","unstructured":"Erd\u0151s P.: On a lemma of Littlewood and Offord. Bull. Am. Math. Soc. 51, 898\u2013902 (1945)","journal-title":"Bull. Am. Math. Soc."},{"key":"1195_CR12","unstructured":"Erd\u0151s, P.: On some new inequalities concerning extremal properties of graphs, in 1968 Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 77\u201381. Academic Press, New York"},{"key":"1195_CR13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(91)90035-Z","volume":"98","author":"P. Erd\u0151s","year":"1991","unstructured":"Erd\u0151s P., F\u00fcredi Z., Tuza Zs.: Saturated r-uniform hypergraphs. Discrete Math. 98, 95\u2013104 (1991)","journal-title":"Discrete Math."},{"key":"1195_CR14","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. Am. Math. Mon. 71, 1107\u20131110 (1964)","journal-title":"Am. Math. Mon."},{"key":"1195_CR15","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(74)90140-X","volume":"8","author":"P. Erd\u0151s","year":"1974","unstructured":"Erd\u0151s P., Kleitman D.J.: Extremal problems among subsets of a set. Discrete Math. 8, 281\u2013294 (1974)","journal-title":"Discrete Math."},{"key":"1195_CR16","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0097-3165(80)90071-0","volume":"28","author":"Z. F\u00fcredi","year":"1980","unstructured":"F\u00fcredi Z.: On maximal intersecting families of finite sets. J. Combin. Theory Ser. A 28, 282\u2013289 (1980)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1195_CR17","unstructured":"F\u00fcredi, Z., Kim, Y.: Cycle-saturated graphs with minimum number of edges (submitted)"},{"issue":"3","key":"1195_CR18","doi-asserted-by":"crossref","first-page":"897","DOI":"10.4007\/annals.2007.166.897","volume":"166","author":"W.T. Gowers","year":"2007","unstructured":"Gowers W.T.: Hypergraph regularity and the multidimensional Szemer\u00e9di theorem. Ann. Math. (2) 166(3), 897\u2013946 (2007)","journal-title":"Ann. Math. (2)"},{"key":"1195_CR19","doi-asserted-by":"crossref","first-page":"R69","DOI":"10.37236\/158","volume":"19","author":"M. Gr\u00fcttm\u00fcller","year":"2009","unstructured":"Gr\u00fcttm\u00fcller M., Hartmann S., Kalinowski T., Leck U., Roberts I.T.: Maximal flat antichains of minimum weight. Electr. J. Combin 19, R69 (2009)","journal-title":"Electr. J. Combin"},{"key":"1195_CR20","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/jgt.3190100209","volume":"10","author":"L. K\u00e1szonyi","year":"1986","unstructured":"K\u00e1szonyi L., Tuza Zs.: Saturated graphs with minimal number of edges. J. Graph Theory 10, 203\u2013210 (1986)","journal-title":"J. Graph Theory"},{"issue":"2","key":"1195_CR21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/rsa.20117","volume":"28","author":"B. Nagle","year":"2006","unstructured":"Nagle B., R\u00f6dl V., Schacht M.: The counting lemma for regular k-uniform hypergraphs. Random Struct. Algorithms 28(2), 113\u2013179 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"1195_CR22","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. Comput. 8, 483\u2013492 (1999)","journal-title":"Combin. Prob. Comput."},{"key":"1195_CR23","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1017\/S0963548301004746","volume":"10","author":"O. Pikhurko","year":"2001","unstructured":"Pikhurko O.: Weakly saturated hypergraphs and exterior algebra. Combin. Prob. Comput. 10, 435\u2013451 (2001)","journal-title":"Combin. Prob. Comput."},{"key":"1195_CR24","first-page":"111","volume":"72","author":"O. Pikhurko","year":"2004","unstructured":"Pikhurko O.: Results and open problems on minimum saturated graphs. Ars Combin. 72, 111\u2013127 (2004)","journal-title":"Ars Combin."},{"key":"1195_CR25","first-page":"211","volume":"40","author":"O. Pikhurko","year":"2008","unstructured":"Pikhurko O., Schmitt J.: A note on minimum K 2,3-saturated graphs. Australas. J. Combin. 40, 211\u2013215 (2008)","journal-title":"Australas. J. Combin."},{"issue":"2","key":"1195_CR26","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1002\/rsa.20108","volume":"28","author":"V. R\u00f6dl","year":"2006","unstructured":"R\u00f6dl V., Skokan J.: Applications of the regularity lemma for uniform hypergraphs. Random Struct. Algorithms 28(2), 180\u2013194 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"1195_CR27","unstructured":"Ruzsa, I., Szemer\u00e9di, E.: Triple systems with no six points carrying three triangles. In: Combinatorics (Keszthely, 1976), vol. II, pp. 939\u2013945. Coll. Math. Soc. J. Bolyai 18"},{"key":"1195_CR28","unstructured":"Simonovits, M.: A method for solving extremal problems in graph theory, stability problems, in 1968 Theory of Graphs (Proc. Colloq., Tihany, 1966), pp. 279\u2013319. Academic Press, New York"},{"key":"1195_CR29","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/BF01171114","volume":"27","author":"E. Sperner","year":"1928","unstructured":"Sperner E.: Ein Satz \u00fcber Untermenge einer endlichen Menge. Math Z. 27, 544\u2013548 (1928)","journal-title":"Math Z."},{"key":"1195_CR30","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P.: Eine Extremalaufgabe aus der Graphentheorie (Hungarian German summary). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"1195_CR31","first-page":"161","volume":"30","author":"Zs. Tuza","year":"1989","unstructured":"Tuza Zs.: C 4-saturated graphs of minimum size. Acta Univ. Carolin. Math. Phys. 30, 161\u2013167 (1989)","journal-title":"Acta Univ. Carolin. Math. Phys."},{"key":"1195_CR32","first-page":"253","volume":"12","author":"W. Wessel","year":"1966","unstructured":"Wessel W.: \"Uber eine Klasse paarer Graphen, I: Beweis einer Vermutung von Erd\u0151os, Hajnal and Moon. Wiss. Z. Hochsch. Ilmenau 12, 253\u2013256 (1966)","journal-title":"Wiss. Z. Hochsch. Ilmenau"},{"key":"1195_CR33","first-page":"423","volume":"13","author":"W. Wessel","year":"1967","unstructured":"Wessel W.: \"Uber eine Klasse paarer Graphen, II: Bestimmung der Minimalgraphen. Wiss. Z. Hochsch. Ilmenau 13, 423\u2013426 (1967)","journal-title":"Wiss. Z. Hochsch. Ilmenau"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1195-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1195-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1195-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T02:57:51Z","timestamp":1594177071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1195-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,26]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["1195"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1195-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,26]]}}}