{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T16:27:52Z","timestamp":1768235272900,"version":"3.49.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1218\/20"],"award-info":[{"award-number":["1218\/20"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00224-025-10239-6","type":"journal-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T13:03:06Z","timestamp":1768222986000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Testing Intersectingness of Uniform Families"],"prefix":"10.1007","volume":"70","author":[{"given":"Ishay","family":"Haviv","sequence":"first","affiliation":[]},{"given":"Michal","family":"Parnas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"issue":"1","key":"10239_CR1","first-page":"1","volume":"5","author":"HT Chau","year":"2025","unstructured":"Chau, H.T., Ellis, D., Friedgut, E., Lifshitz, N.: On the maximum degree of induced subgraphs of the Kneser graph. Comb. Theory 5(1), 1\u201335 (2025)","journal-title":"Comb. Theory"},{"key":"10239_CR2","unstructured":"Chen, X., De, A., Li, Y., Nadimpalli, S., Servedio, R.A.: Testing intersecting and union-closed families. In: Proceedings of the 15th Innovations in Theoretical Computer Science Conference (ITCS\u201924), pp. 33:1\u201333:23 (2024)"},{"issue":"1\u20132","key":"10239_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1017\/S0963548308009309","volume":"18","author":"I Dinur","year":"2009","unstructured":"Dinur, I., Friedgut, E.: Intersecting families are essentially contained in juntas. Comb. Probab. Comput. 18(1\u20132), 107\u2013122 (2009)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"10239_CR4","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. Quart. J. Math. 12(1), 313\u2013320 (1961)","journal-title":"Quart. J. Math."},{"key":"10239_CR5","unstructured":"Fischer, E.: A basic lower bound for property testing. arXiv:2403.04999 (2024)"},{"issue":"1","key":"10239_CR6","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/jgt.23213","volume":"109","author":"P Frankl","year":"2025","unstructured":"Frankl, P., Kupavskii, A.: Maximal degrees in subgraphs of Kneser graphs. J. Graph Theory 109(1), 88\u201396 (2025)","journal-title":"J. Graph Theory"},{"key":"10239_CR7","first-page":"1","volume":"2","author":"E Friedgut","year":"2018","unstructured":"Friedgut, E., Regev, O.: Kneser graphs are like Swiss cheese. Discret. Anal. 2, 1\u201318 (2018)","journal-title":"Discret. Anal."},{"key":"10239_CR8","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Introduction to Property Testing. Cambridge University Press, (2017)","DOI":"10.1017\/9781108135252"},{"key":"10239_CR9","unstructured":"Haviv, I., Parnas, M.: Testing intersectingness of uniform families. In: Proceedings of the 28th International Conference on Randomization and Computation (RANDOM\u201924), vol. 317, pp. 35:1\u201315 (2024)"},{"issue":"2","key":"10239_CR10","first-page":"27","volume":"58","author":"M Kneser","year":"1955","unstructured":"Kneser, M.: Aufgabe 360. Jahresber. Deutsch. Math.-Verein. 58(2), 27 (1955)","journal-title":"Jahresber. Deutsch. Math.-Verein."},{"issue":"3","key":"10239_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0097-3165(78)90022-5","volume":"25","author":"L Lov\u00e1sz","year":"1978","unstructured":"Lov\u00e1sz, L.: Kneser\u2019s conjecture, chromatic number, and homotopy. J. Comb. Theory Ser. A 25(3), 319\u2013324 (1978)","journal-title":"J. Comb. Theory Ser. A"},{"key":"10239_CR12","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.: Concentration. In: Probabilistic methods for algorithmic discrete mathematics, vol.\u00a016 of Algorithms Combin., pp. 195\u2013248. Springer, Berlin, (1998)","DOI":"10.1007\/978-3-662-12788-9_6"},{"key":"10239_CR13","doi-asserted-by":"crossref","unstructured":"Merino, A.I., M\u00fctze, T., Namrata.: Kneser graphs are Hamiltonian. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC\u201923), pp. 963\u2013970 (2023)","DOI":"10.1145\/3564246.3585137"},{"issue":"6","key":"10239_CR14","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1016\/j.jcss.2006.03.002","volume":"72","author":"M Parnas","year":"2006","unstructured":"Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. J. Comput. Syst. Sci. 72(6), 1012\u20131042 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"10239_CR15","doi-asserted-by":"crossref","unstructured":"Tell, R.: A note on tolerant testing with one-sided error. In: Computational Complexity and Property Testing \u2013 On the Interplay Between Randomness and Computation, pp. 173\u2013177. Springer, (2020)","DOI":"10.1007\/978-3-030-43662-9_11"},{"key":"10239_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Probabilistic computations: Toward a unified measure of complexity (extended abstract). In: Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS\u201977), pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10239-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-025-10239-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-025-10239-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T13:03:19Z","timestamp":1768222999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-025-10239-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10239"],"URL":"https:\/\/doi.org\/10.1007\/s00224-025-10239-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,12]]},"assertion":[{"value":"16 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}