{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:19:24Z","timestamp":1768450764250,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171028"],"award-info":[{"award-number":["12171028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12371326"],"award-info":[{"award-number":["12371326"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Natural Science Foundation of Beijing Municipality","doi-asserted-by":"publisher","award":["1222013"],"award-info":[{"award-number":["1222013"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00373-024-02790-9","type":"journal-article","created":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T09:01:54Z","timestamp":1715072514000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Almost Intersecting Families for Vector Spaces"],"prefix":"10.1007","volume":"40","author":[{"given":"Yunjing","family":"Shan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5725-4920","authenticated-orcid":false,"given":"Junling","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,7]]},"reference":[{"key":"2790_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0095-8956(80)90062-3","volume":"28","author":"R Ahlswede","year":"1980","unstructured":"Ahlswede, R.: Simple hypergraphs with maximal number of adjacent pairs of edges. J. Comb. Theory Ser. B 28, 164\u2013167 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2790_CR2","doi-asserted-by":"publisher","first-page":"R71","DOI":"10.37236\/343","volume":"17","author":"A Blokhuis","year":"2010","unstructured":"Blokhuis, A., Brouwer, A.E., Chowdhury, A., Frankl, P., Mussche, T., Patk\u00f3s, B., Sz\u0151nyi, T.: A Hilton\u2013Milner theorem for vector spaces. Electron. J. Comb. 17, R71 (2010)","journal-title":"Electron. J. Comb."},{"key":"2790_CR3","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s00493-003-0033-0","volume":"23","author":"B Bollob\u00e1s","year":"2003","unstructured":"Bollob\u00e1s, B., Leader, I.: Set systems with few disjoint pairs. Combinatorica 23, 559\u2013570 (2003)","journal-title":"Combinatorica"},{"issue":"12","key":"2790_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"2","author":"P Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P., Ko, C., Rado, R.: Intersection theorems for systems of finite sets. Q. J. Math. Oxf. 2(12), 313\u2013320 (1961)","journal-title":"Q. J. Math. Oxf."},{"key":"2790_CR5","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0097-3165(77)90056-5","volume":"22","author":"P Frankl","year":"1977","unstructured":"Frankl, P.: On the minimum number of disjoint pairs in a family of finite sets. J. Comb. Theory Ser. A 22, 249\u2013251 (1977)","journal-title":"J. Comb. Theory Ser. A"},{"key":"2790_CR6","doi-asserted-by":"crossref","unstructured":"Frankl, P., Kupavskii, A.: Almost intersecting families. Electron. J. Comb. 28(2) (2021)","DOI":"10.37236\/9609"},{"key":"2790_CR7","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1137\/120878744","volume":"26","author":"D Gerbner","year":"2012","unstructured":"Gerbner, D., Lemons, N., Palmer, C., Patk\u00f3s, B., Sz\u00e9csi, V.: Almost intersecting families of sets. SIAM J. Discret. Math. 26, 1657\u20131699 (2012)","journal-title":"SIAM J. Discret. Math."},{"key":"2790_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(75)90091-6","volume":"12","author":"WN Hsieh","year":"1975","unstructured":"Hsieh, W.N.: Intersection theorems for systems of finite vector spaces. Discret. Math. 12, 1\u201316 (1975)","journal-title":"Discret. Math."},{"key":"2790_CR9","unstructured":"Lov\u00e1sz, L.: Flats in matroids and geometric graphs. In: Combinatorial Surveys, Proceedings of the 6th British Combinatorial Conference, Egham 1977, pp. 45\u201386. Academic Press, London (1977)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02790-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02790-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02790-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:04:41Z","timestamp":1721707481000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02790-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,7]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2790"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02790-9","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,7]]},"assertion":[{"value":"10 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"There is no conflict of interest to report.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"62"}}