{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T05:34:37Z","timestamp":1772516077408,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,14]],"date-time":"2012-03-14T00:00:00Z","timestamp":1331683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00454-012-9419-3","type":"journal-article","created":{"date-parts":[[2012,3,13]],"date-time":"2012-03-13T13:12:20Z","timestamp":1331644340000},"page":"487-498","source":"Crossref","is-referenced-by-count":29,"title":["A New Lower Bound Based on Gromov\u2019s Method of Selecting Heavily Covered Points"],"prefix":"10.1007","volume":"48","author":[{"given":"Daniel","family":"Kr\u00e1l\u2019","sequence":"first","affiliation":[]},{"given":"Luk\u00e1\u0161","family":"Mach","sequence":"additional","affiliation":[]},{"given":"Jean-S\u00e9bastien","family":"Sereni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,14]]},"reference":[{"key":"9419_CR1","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0963548310000222","volume":"20","author":"R. Baber","year":"2011","unstructured":"Baber, R., Talbot, J.: Hypergraphs do jump. Comb. Probab. Comput. 20, 161\u2013171 (2011)","journal-title":"Comb. Probab. Comput."},{"key":"9419_CR2","doi-asserted-by":"crossref","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\u2019s theorem. Discrete Math. 40, 141\u2013152 (1982)","journal-title":"Discrete Math."},{"key":"9419_CR3","first-page":"354","volume-title":"Computational Geometry (SCG\u201910)","author":"A. Basit","year":"2010","unstructured":"Basit, A., Mustafa, N.H., Ray, S., Raza, S.: Improving the first selection lemma in \u211d3. In: Computational Geometry (SCG\u201910), pp. 354\u2013357. ACM, New York (2010)"},{"key":"9419_CR4","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF00181519","volume":"17","author":"E. Boros","year":"1984","unstructured":"Boros, E., F\u00fcredi, Z.: The number of triangles covering the center of an n-set. Geom. Dedic. 17, 69\u201377 (1984)","journal-title":"Geom. Dedic."},{"key":"9419_CR5","doi-asserted-by":"crossref","unstructured":"Bukh, B.: A point in many triangles. Electron. J. Comb., 13, pp. Note 10 (2006), 3 pp. (electronic)","DOI":"10.37236\/1148"},{"key":"9419_CR6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s00454-008-9124-4","volume":"43","author":"B. Bukh","year":"2010","unstructured":"Bukh, B., Matou\u0161ek, J., Nivasch, G.: Stabbing simplices by points and flats. Discrete Comput. Geom. 43, 321\u2013338 (2010)","journal-title":"Discrete Comput. Geom."},{"key":"9419_CR7","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1090\/S0894-0347-06-00529-7","volume":"20","author":"M. Freedman","year":"2007","unstructured":"Freedman, M., Lov\u00e1sz, L., Schrijver, A.: Reflection positivity, rank connectivity, and homomorphism of graphs. J. Am. Math. Soc. 20, 37\u201351 (2007) (electronic)","journal-title":"J. Am. Math. Soc."},{"key":"9419_CR8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/s00039-010-0073-8","volume":"20","author":"M. Gromov","year":"2010","unstructured":"Gromov, M.: Singularities, expanders and topology of maps. Part\u00a02: From combinatorics to topology via algebraic isoperimetry. Geom. Funct. Anal. 20, 416\u2013526 (2010)","journal-title":"Geom. Funct. Anal."},{"key":"9419_CR9","unstructured":"Grzesik, A.: On the maximum number of C5\u2019s in a triangle-free graph (2011). arXiv:1102.0962 . Submitted for publication"},{"key":"9419_CR10","unstructured":"Hatami, H., Hladk\u00fd, J., Kr\u00e1l\u2019, D., Norine, S., Razborov, A.: Non-three-colorable common graphs exist (2011). arXiv:1105.0307 . Submitted for publication"},{"key":"9419_CR11","unstructured":"Hatami, H., Hladk\u00fd, J., Kr\u00e1l\u2019, D., Norine, S., Razborov, A.: On the number of pentagons in triangle-free graphs (2011). arXiv:1102.1634 . Submitted for publication"},{"key":"9419_CR12","unstructured":"Hladk\u00fd, J., Kr\u00e1l\u2019, D., Norine, S.: Counting flags in triangle-free digraphs (2009). arXiv:0908.2791 . Submitted for publication"},{"key":"9419_CR13","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1007\/s00454-011-9332-1","volume":"47","author":"R.N. Karasev","year":"2012","unstructured":"Karasev, R.N.: A simpler proof of the Boros\u2013F\u00fcredi\u2013B\u00e1r\u00e1ny\u2013Pach\u2013Gromov theorem. Discrete Comput. Geom. 47, 492\u2013495 (2012)","journal-title":"Discrete Comput. Geom."},{"key":"9419_CR14","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/j.jctb.2006.05.002","volume":"96","author":"L. Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Szegedy, B.: Limits of dense graph sequences. J. Comb. Theory, Ser. B 96, 933\u2013957 (2006)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"9419_CR15","unstructured":"Matou\u0161ek, J., Wagner, U.: On Gromov\u2019s method of selecting heavily covered points (2011). arXiv:1102.3515 . Submitted for publication"},{"key":"9419_CR16","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.2178\/jsl\/1203350785","volume":"72","author":"A. Razborov","year":"2007","unstructured":"Razborov, A.: Flag algebras. J. Symb. Log. 72, 1239\u20131282 (2007)","journal-title":"J. Symb. Log."},{"key":"9419_CR17","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/090747476","volume":"24","author":"A. Razborov","year":"2010","unstructured":"Razborov, A.: On 3-hypergraphs with forbidden 4-vertex configurations. SIAM J. Discrete Math. 24, 946\u2013963 (2010)","journal-title":"SIAM J. Discrete Math."},{"key":"9419_CR18","unstructured":"Wagner, U.: On k-sets and applications. Ph.D. thesis, ETH Z\u00fcrich (2003)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9419-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9419-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9419-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,4]],"date-time":"2020-07-04T04:13:19Z","timestamp":1593835999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9419-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,14]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9419"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9419-3","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,14]]}}}