Radon numbers and the fractional Helly theorem
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Holmsen, Andreas F. | ko |
| dc.contributor.author | Lee, Donggyu | ko |
| dc.date.accessioned | 2021-04-19T02:30:05Z | - |
| dc.date.available | 2021-04-19T02:30:05Z | - |
| dc.date.created | 2021-03-17 | - |
| dc.date.issued | 2021-03 | - |
| dc.identifier.citation | Israel Journal of Mathematics, v.241, no.1, pp.433 - 447 | - |
| dc.identifier.issn | 0021-2172 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/282414 | - |
| dc.description.abstract | A basic measure of the combinatorial complexity of a convexity space is its Radon number. In this paper we answer a question of Kalai, by showing a fractional Helly theorem for convexity spaces with bounded Radon number. As a consequence we also get a weak epsilon-net theorem for convexity spaces with bounded Radon number. This answers a question of Bukh and extends a recent result of Moran and Yehudayoff. | - |
| dc.language | English | - |
| dc.publisher | Magnes Press | - |
| dc.title | Radon numbers and the fractional Helly theorem | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000618607300003 | - |
| dc.identifier.scopusid | 2-s2.0-85101066648 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 241 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 433 | - |
| dc.citation.endingpage | 447 | - |
| dc.citation.publicationname | Israel Journal of Mathematics | - |
| dc.identifier.doi | 10.1007/s11856-021-2102-8 | - |
| dc.contributor.localauthor | Holmsen, Andreas F. | - |
| dc.contributor.nonIdAuthor | Lee, Donggyu | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 8 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.