ENGLISH

Combinatorial convexity

By Imre Bárány

Book information

Publisher
American Mathematical Society
Year
2021
ISBN
9781470467685, 1470467682
Language
english
Format
PDF
Filesize
2 MB (1740553 bytes)
Series
University Lecture Ser
Pages
\159
Library
RU-board
Time added
2021-11-18 10:57:18

Description

Cover Title page Copyright Contents Preface Basic concepts Carathéodory’s theorem Radon’s theorem Topological Radon Tverberg’s theorem General position Helly’s theorem Applications of Helly’s theorem Fractional Helly Colourful Carathéodory Colourful Carathéodory again Colourful Helly Tverberg’s theorem again Colourful Tverberg theorem Sarkaria and Kirchberger generalized The Erdős-Szekers theorem The same type lemma Better bound for the Erdős-Szekeres number Covering number, planar case The stretched grid Covering number, general case Upper bound on the covering number The point selection theorem Homogeneous selection Missing few simplices Weak 𝜖-nets Lower bound on the size of weak 𝜖-nets The (𝑝,𝑞) theorem The colourful (𝑝,𝑞) theorem 𝑑-intervals Halving lines, havling planes Convex lattice sets Fractional Helly for convex lattice sets Bibliography Index Back Cover

Similar books