{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T19:10:11Z","timestamp":1746817811047,"version":"3.40.5"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T00:00:00Z","timestamp":1719446400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T00:00:00Z","timestamp":1719446400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100006087","name":"Direcci\u00f3n General de Asuntos del Personal Acad\u00e9mico, Universidad Nacional Aut\u00f3noma de M\u00e9xico","doi-asserted-by":"publisher","award":["IN111923"],"award-info":[{"award-number":["IN111923"]}],"id":[{"id":"10.13039\/501100006087","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2025,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Let <jats:italic>K<\/jats:italic> be a compact convex set in <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathbb {R}^{2}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and let <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathcal {F}_{1}, \\mathcal {F}_{2}, \\mathcal {F}_{3}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mn>2<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mn>3<\/mml:mn>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> be finite families of translates of <jats:italic>K<\/jats:italic> such that <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$A \\cap B \\ne \\emptyset $$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>A<\/mml:mi>\n                    <mml:mo>\u2229<\/mml:mo>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mo>\u2260<\/mml:mo>\n                    <mml:mi>\u2205<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> for every <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$A \\in \\mathcal {F}_{i}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>A<\/mml:mi>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$B \\in \\mathcal {F}_{j}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>B<\/mml:mi>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mi>j<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> with <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$i \\ne j$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>i<\/mml:mi>\n                    <mml:mo>\u2260<\/mml:mo>\n                    <mml:mi>j<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>. A conjecture by Dol\u2019nikov is that, under these conditions, there is always some <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$j \\in \\{ 1,2,3 \\}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>j<\/mml:mi>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:mo>{<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mn>3<\/mml:mn>\n                    <mml:mo>}<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> such that <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathcal {F}_{j}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:mi>j<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> can be pierced by 3 points. In this paper we prove a stronger version of this conjecture when <jats:italic>K<\/jats:italic> is a body of constant width or when it is close in Banach-Mazur distance to a disk. We also show that the conjecture is true with 8 piercing points instead of 3. Along the way we prove more general statements both in the plane and in higher dimensions. A related result was given by Mart\u00ednez-Sandoval, Rold\u00e1n-Pensado and Rubin. They showed that if <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathcal {F}_{1}, \\dots , \\mathcal {F}_{d}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u22ef<\/mml:mo>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mi>d<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> are finite families of convex sets in <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathbb {R}^{d}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>R<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> such that for every choice of sets <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$C_{1} \\in \\mathcal {F}_{1}, \\dots , C_{d} \\in \\mathcal {F}_{d}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msub>\n                      <mml:mi>C<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mn>1<\/mml:mn>\n                    <\/mml:msub>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u22ef<\/mml:mo>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>C<\/mml:mi>\n                      <mml:mi>d<\/mml:mi>\n                    <\/mml:msub>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mi>d<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> the intersection <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\bigcap _{i=1}^{d} {C_{i}}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msubsup>\n                      <mml:mo>\u22c2<\/mml:mo>\n                      <mml:mrow>\n                        <mml:mi>i<\/mml:mi>\n                        <mml:mo>=<\/mml:mo>\n                        <mml:mn>1<\/mml:mn>\n                      <\/mml:mrow>\n                      <mml:mi>d<\/mml:mi>\n                    <\/mml:msubsup>\n                    <mml:msub>\n                      <mml:mi>C<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> is non-empty, then either there exists <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$j \\in \\{ 1,2, \\dots , n \\}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>j<\/mml:mi>\n                    <mml:mo>\u2208<\/mml:mo>\n                    <mml:mo>{<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u22ef<\/mml:mo>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>}<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> such that <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathcal {F}_j$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:mi>j<\/mml:mi>\n                  <\/mml:msub>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> can be pierced by few points or <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\bigcup _{i=1}^{n} \\mathcal {F}_{i}$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:msubsup>\n                      <mml:mo>\u22c3<\/mml:mo>\n                      <mml:mrow>\n                        <mml:mi>i<\/mml:mi>\n                        <mml:mo>=<\/mml:mo>\n                        <mml:mn>1<\/mml:mn>\n                      <\/mml:mrow>\n                      <mml:mi>n<\/mml:mi>\n                    <\/mml:msubsup>\n                    <mml:msub>\n                      <mml:mi>F<\/mml:mi>\n                      <mml:mi>i<\/mml:mi>\n                    <\/mml:msub>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> can be crossed by few lines. We give optimal values for the number of piercing points and crossing lines needed when <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$d=2$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>d<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and also consider the problem restricted to special families of convex sets.<\/jats:p>","DOI":"10.1007\/s00454-024-00669-3","type":"journal-article","created":{"date-parts":[[2024,6,27]],"date-time":"2024-06-27T15:05:47Z","timestamp":1719500747000},"page":"1079-1096","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Transversals to Colorful Intersecting Convex Sets"],"prefix":"10.1007","volume":"73","author":[{"given":"Cuauhtemoc","family":"Gomez-Navarro","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2164-066X","authenticated-orcid":false,"given":"Edgardo","family":"Rold\u00e1n-Pensado","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,27]]},"reference":[{"issue":"2","key":"669_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/s00454-009-9180-4","volume":"42","author":"JL Arocha","year":"2009","unstructured":"Arocha, J.L., B\u00e1r\u00e1ny, I., Bracho, J., Fabila, R., Montejano, L.: Very colorful theorems. Discrete Comput. Geom. 42(2), 142\u2013154 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"669_CR2","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(82)90115-7","volume":"40","author":"I B\u00e1r\u00e1ny","year":"1982","unstructured":"B\u00e1r\u00e1ny, I.: A generalization of Carath\u00e9odory theorem. Discrete Math. 40, 141\u2013152 (1982)","journal-title":"Discrete Math."},{"issue":"7","key":"669_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1080\/00029890.1969.12000319","volume":"76","author":"GD Chakerian","year":"1969","unstructured":"Chakerian, G.D.: Intersection and covering properties of convex sets. Am. Math. Mon. 76(7), 753\u2013766 (1969)","journal-title":"Am. Math. Mon."},{"key":"669_CR4","first-page":"111","volume":"21","author":"L Danzer","year":"1986","unstructured":"Danzer, L.: Zur L\u00f6sung des Gallaischen Problems \u00fcber Kreisscheiben in der euklidischen Ebene. Studia Sci. Math. Hung. 21, 111\u2013134 (1986)","journal-title":"Studia Sci. Math. Hung."},{"key":"669_CR5","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/s00453-010-9410-4","volume":"61","author":"A Dumitrescu","year":"2011","unstructured":"Dumitrescu, A., Jiang, M.: Piercing translates and homothets of a convex body. Algorithmica 61, 94\u2013115 (2011)","journal-title":"Algorithmica"},{"issue":"1\u20133","key":"669_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0012-365X(93)90587-J","volume":"120","author":"DG Fon-Der-Flaass","year":"1993","unstructured":"Fon-Der-Flaass, D.G., Kostochka, A.V.: Covering boxes by points. Discrete Math. 120(1\u20133), 269\u2013275 (1993)","journal-title":"Discrete Math."},{"key":"669_CR7","unstructured":"Gomez-Navarro, C.: Colorful theorems in discrete and convex geometry. Master\u2019s Thesis, Universidad Nacional Aut\u00f3noma de M\u00e9xico (2022). https:\/\/ru.dgb.unam.mx\/handle\/20.500.14330\/TES01000832491"},{"key":"669_CR8","first-page":"155","volume":"18","author":"B Gr\u00fcnbaum","year":"1959","unstructured":"Gr\u00fcnbaum, B.: On intersections of similar sets. Portugal Math. 18, 155\u2013164 (1959)","journal-title":"Portugal Math."},{"key":"669_CR9","volume-title":"Combinatorial Geometry in the Plane","author":"H Hadwiger","year":"1966","unstructured":"Hadwiger, H., Debrunner, H.: Combinatorial Geometry in the Plane. Dover Publications, Mineola (1966)"},{"key":"669_CR10","first-page":"175","volume":"32","author":"E Helly","year":"1923","unstructured":"Helly, E.: Uber Mengen konvexer Korper mit gemeinschaftlichen Punkten. Jahres-berichte der Deutschen Math Verein. 32, 175\u2013176 (1923)","journal-title":"Jahres-berichte der Deutschen Math Verein."},{"issue":"6","key":"669_CR11","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/s00493-008-2427-5","volume":"28","author":"AF Holmsen","year":"2008","unstructured":"Holmsen, A.F., Pach, J., Tverberg, H.: Points surrounding the origin. Combinatorica 28(6), 633\u2013644 (2008)","journal-title":"Combinatorica"},{"issue":"9","key":"669_CR12","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1016\/j.disc.2015.04.009","volume":"338","author":"J Jer\u00f3nimo-Castro","year":"2015","unstructured":"Jer\u00f3nimo-Castro, J., Magazinov, A., Sober\u00f3n, P.: On a problem by Dol\u2019nikov. Discrete Math. 338(9), 1577\u20131585 (2015)","journal-title":"Discrete Math."},{"key":"669_CR13","unstructured":"John, F.: Extremum problems with inequalities as subsidiary conditions. In: Courant Anniversary Volume, pp. 187\u2013204. Interscience Publishers, New York (1948)"},{"issue":"2","key":"669_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s004540010040","volume":"24","author":"RN Karasev","year":"2000","unstructured":"Karasev, R.N.: Transversals for families of translates of a two-dimensional convex compact set. Discrete Comput. Geom. 24(2), 345\u2013354 (2000)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"669_CR15","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1007\/s00454-007-9040-z","volume":"39","author":"RN Karasev","year":"2008","unstructured":"Karasev, R.N.: Piercing families of convex sets with the $$ d $$-intersection property in $$ \\mathbb{R} ^{d} $$. Discrete Comput. Geom. 39(4), 766\u2013777 (2008)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"669_CR16","doi-asserted-by":"publisher","first-page":"132","DOI":"10.4064\/fm-14-1-132-137","volume":"14","author":"B Knaster","year":"1929","unstructured":"Knaster, B., Kuratowski, C., Mazurkiewicz, S.: Ein Beweis des Fixpunktsatzes f\u00fcr n-dimensionale Simplexe. Fundam. Math. 14(1), 132\u2013137 (1929)","journal-title":"Fundam. Math."},{"issue":"18","key":"669_CR17","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1016\/j.disc.2006.05.014","volume":"306","author":"S-J Kim","year":"2006","unstructured":"Kim, S.-J., Nakprasit, K., Pelsmajer, M.J., Skokan, J.: Transversal numbers of translates of a convex body. Discrete Math. 306(18), 2166\u20132173 (2006)","journal-title":"Discrete Math."},{"key":"669_CR18","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/s00010-007-2874-x","volume":"74","author":"M Lassak","year":"2007","unstructured":"Lassak, M.: Banach\u2013Mazur distance of planar convex bodies. Aequationes math. 74, 282\u2013286 (2007)","journal-title":"Aequationes math."},{"issue":"4","key":"669_CR19","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1007\/s00454-019-00085-y","volume":"63","author":"L Mart\u00ednez-Sandoval","year":"2020","unstructured":"Mart\u00ednez-Sandoval, L., Rold\u00e1n-Pensado, E., Rubin, N.: Further consequences of the colorful Helly hypothesis. Discrete Comput. Geom. 63(4), 848\u2013866 (2020)","journal-title":"Discrete Comput. Geom."},{"key":"669_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03868-7","volume-title":"Bodies of Constant Width","author":"H Martini","year":"2019","unstructured":"Martini, H., Montejano, L., Oliveros, D.: Bodies of Constant Width. Springer, Cham (2019)"},{"key":"669_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"J Matou\u0161ek","year":"2002","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry, vol. 212. Springer, New York (2002)"},{"issue":"3","key":"669_CR22","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/s00454-022-00391-y","volume":"68","author":"D McGinnis","year":"2022","unstructured":"McGinnis, D.: A family of convex sets in the plane satisfying the (4, 3)-property can be pierced by nine points. Discrete Comput. Geom. 68(3), 860\u2013880 (2022)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"669_CR23","doi-asserted-by":"publisher","first-page":"2916","DOI":"10.1137\/21M1408920","volume":"36","author":"D McGinnis","year":"2022","unstructured":"McGinnis, D., Zerbib, S.: Line transversals in families of connected sets in the plane. SIAM J. Discrete Math. 36(4), 2916\u20132919 (2022)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"669_CR24","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disc.2009.07.030","volume":"310","author":"M Nasz\u00f3di","year":"2010","unstructured":"Nasz\u00f3di, M., Taschuk, S.: On the transversal number and VC-dimension of families of positive homothets of a convex body. Discrete Math. 310(1), 77\u201382 (2010)","journal-title":"Discrete Math."},{"issue":"2","key":"669_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1112\/S0025579300004083","volume":"10","author":"CA Rogers","year":"1963","unstructured":"Rogers, C.A.: Covering a sphere with spheres. Mathematika 10(2), 157\u2013164 (1963)","journal-title":"Mathematika"},{"key":"669_CR26","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00454-004-2916-2","volume":"33","author":"JL Verger-Gaugry","year":"2005","unstructured":"Verger-Gaugry, J.L.: Covering a ball with smaller equal balls in $$ \\mathbb{R} ^{n} $$. Discrete Comput. Geom. 33, 143\u2013155 (2005)","journal-title":"Discrete Comput. Geom."}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00669-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00454-024-00669-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-024-00669-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T18:49:30Z","timestamp":1746816570000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00454-024-00669-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,27]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["669"],"URL":"https:\/\/doi.org\/10.1007\/s00454-024-00669-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2024,6,27]]},"assertion":[{"value":"31 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}