{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,25]],"date-time":"2023-11-25T00:40:38Z","timestamp":1700872838183},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00493-023-00046-3","type":"journal-article","created":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T09:01:51Z","timestamp":1686646911000},"page":"1045-1066","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximal 3-Wise Intersecting Families"],"prefix":"10.1007","volume":"43","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ce","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Hendrey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ben","family":"Lund","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoran","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Casey","family":"Tompkins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tuan","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,13]]},"reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF02582924","volume":"1","author":"N Alon","year":"1985","unstructured":"Alon, N., Frankl, P.: The maximum number of disjoint pairs in a family of subsets. Graphs Combinatorics 1, 13\u201321 (1985)","journal-title":"Graphs Combinatorics"},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jctb.2015.05.009","volume":"115","author":"N Alon","year":"2015","unstructured":"Alon, N., Das, S., Glebov, R., Sudakov, B.: Comparable pairs in families of sets. J. Combinatorial Theory Series B 115, 164\u2013185 (2015)","journal-title":"J. Combinatorial Theory Series B"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s00493-015-3290-9","volume":"37","author":"J Balogh","year":"2017","unstructured":"Balogh, J., Bushaw, N., Collares, M., Liu, H., Morris, R., Sharifzadeh, M.: The typical structure of graphs with no large cliques. Combinatorica 37, 617\u2013632 (2017)","journal-title":"Combinatorica"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Balogh, J., Chen, C., Luo, H.: Maximal$$3$$-wise Intersecting Families with Minimum Size: the Odd Case, arXiv:2206.09334 (2022)","DOI":"10.1007\/s00493-023-00046-3"},{"issue":"1","key":"46_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0097-3165(89)90057-5","volume":"52","author":"E Boros","year":"1989","unstructured":"Boros, E., F\u00fcredi, Z., Kahn, J.: Maximal intersecting families and affine regular polygons in $$PG(2, q)$$. J. Combinatorial Theory Series A 52(1), 1\u20139 (1989)","journal-title":"J. Combinatorial Theory Series A"},{"issue":"4","key":"46_CR6","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1112\/blms.12184","volume":"50","author":"M Buci\u0107","year":"2018","unstructured":"Buci\u0107, M., Letzter, S., Sudakov, B., Tran, T.: Minimum saturated families of sets. Bull. Lond. Math. Soc. 50(4), 725\u2013732 (2018)","journal-title":"Bull. Lond. Math. Soc."},{"key":"46_CR7","first-page":"47","volume":"48","author":"SJ Dow","year":"1985","unstructured":"Dow, S.J., Drake, D.A., F\u00fcredi, Z., Larson, J.A.: A lower bound for the cardinality of a maximal family of mutually intersecting sets of equal size. Proc. 16th Southeast. Int. Conf. Combinatorics Graph Theory Comput. 48, 47\u201348 (1985)","journal-title":"Proc. 16th Southeast. Int. Conf. Combinatorics Graph Theory Comput."},{"issue":"18","key":"46_CR8","doi-asserted-by":"publisher","first-page":"4272","DOI":"10.1016\/j.disc.2007.08.006","volume":"308","author":"P Dukes","year":"2008","unstructured":"Dukes, P., Howard, L.: Small maximally disjoint union-free families. Discret. Math. 308(18), 4272\u20134275 (2008)","journal-title":"Discret. Math."},{"issue":"8","key":"46_CR9","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1016\/j.jcta.2011.06.003","volume":"118","author":"D Ellis","year":"2011","unstructured":"Ellis, D., Sudakov, B.: Generating all subsets of a finite set with disjoint unions. J. Combinatorial Theory Series A 118(8), 2319\u20132345 (2011)","journal-title":"J. Combinatorial Theory Series A"},{"issue":"3","key":"46_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF02759942","volume":"2","author":"P Erd\u0151s","year":"1964","unstructured":"Erd\u0151s, P.: On extremal problems of graphs and generalized graphs. Israel J. Math. 2(3), 183\u2013190 (1964)","journal-title":"Israel J. Math."},{"key":"46_CR11","unstructured":"Erd\u0151s, P.: Problem sessions, I.\u00a0Rival (Ed.), Ordered Sets, Proceedings of the NATO Advanced Study, Reidel, Dordrecht, 860\u2013861 (1981)"},{"key":"46_CR12","unstructured":"Erd\u0151s, P., Lov\u00e1sz, L.: Problems and results on$$3$$-chromatic hypergraphs and some related questions, Colloquia Mathematica Societatis J\u00e1nos Bolyai 10. Infinite and Finite Sets Keszthely (Hungary) (1973)"},{"key":"46_CR13","doi-asserted-by":"publisher","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. Discret. Math. 8, 281\u2013294 (1974)","journal-title":"Discret. Math."},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Q. J. Math. Oxford Second Series 12, 313\u2013320 (1961)","journal-title":"Q. J. Math. Oxford Second Series"},{"issue":"1","key":"46_CR15","doi-asserted-by":"publisher","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(1), 1107\u20131110 (1964)","journal-title":"Am. Math. Mon."},{"key":"46_CR16","doi-asserted-by":"crossref","first-page":"36","DOI":"10.37236\/523","volume":"18","author":"J Faudree","year":"2011","unstructured":"Faudree, J., Faudree, R., Schmitt, J.R.: A survey of minimum saturated graphs. Electron. J. Combinatorics 18, 36 (2011)","journal-title":"Electron. J. Combinatorics"},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.ejc.2022.103528","volume":"104","author":"N Frankl","year":"2022","unstructured":"Frankl, N., Kiselev, S., Kupavskii, A., Patk\u00f3s, B.: VC-saturated set systems. Eur. J. Combinatorics 104, 10 (2022)","journal-title":"Eur. J. Combinatorics"},{"issue":"5","key":"46_CR18","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1007\/s00373-012-1195-6","volume":"29","author":"D Gerbner","year":"2013","unstructured":"Gerbner, D., Keszegh, B., Lemons, N., Palmer, C., P\u00e1lv\u00f6lgyi, D., Patk\u00f3s, B.: Saturating Sperner families. Graphs Combinatorics 29(5), 1355\u20131364 (2013)","journal-title":"Graphs Combinatorics"},{"key":"46_CR19","first-page":"118","volume":"90","author":"RK Guy","year":"1983","unstructured":"Guy, R.K.: A miscellany of Erd\u0151s problems. Am. Math. Mon. 90, 118\u2013120 (1983)","journal-title":"Am. Math. Mon."},{"key":"46_CR20","unstructured":"Hendrey, K., Lund, B., Tompkins, C., Tran, T.: Maximal$$3$$-wise intersecting families, arXiv:2110.12708v1 (2021)"},{"key":"46_CR21","doi-asserted-by":"crossref","unstructured":"Janzer, B.: A note on saturation for$$k$$-wise intersecting families, Combinatorial Theory, 2(2), Paper No. 11, 5 pp (2022)","DOI":"10.5070\/C62257877"},{"issue":"1","key":"46_CR22","first-page":"125","volume":"7","author":"J Kahn","year":"1994","unstructured":"Kahn, J.: On a problem of Erd\u0151s and Lov\u00e1sz. J. Am. Math. Soc. 7(1), 125\u2013143 (1994)","journal-title":"J. Am. Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00046-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00493-023-00046-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-023-00046-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,24]],"date-time":"2023-11-24T14:03:39Z","timestamp":1700834619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00493-023-00046-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["46"],"URL":"https:\/\/doi.org\/10.1007\/s00493-023-00046-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,13]]},"assertion":[{"value":"1 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}