Combinatorial convexity / Imre Bárány.

Format:

Book

Author/Creator:

Bárány, Imre, author.

Series:

University Lecture Series, v. 77

Language:

English

Subjects (All):

Convex sets.

Combinatorial analysis.

Physical Description:

1 online resource

Place of Publication:

Providence, Rhode Island : American Mathematical Society, [2021]

System Details:

Mode of access : World Wide Web

Contents:

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 $\varepsilon $-nets Lower bound on the size of weak $\varepsilon $-nets The $(p,q)$ theorem The colourful $(p,q)$ theorem $d$-intervals Halving lines, havling planes Convex lattice sets Fractional Helly for convex lattice sets

Notes:

Includes bibliographical references and index.

Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2021

Description based on print version record.

Other Format:

Print version: Bárány, Imre, Combinatorial convexity /

ISBN:

9781470467685 (online)

Access Restriction:

Restricted for use by site license.