Geometry, Structure and Randomness in Combinatorics

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Matoušek, Jiří (Επιμελητής έκδοσης), Nešetřil, Jaroslav (Επιμελητής έκδοσης), Pellegrini, Marco (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Pisa : Scuola Normale Superiore : Imprint: Edizioni della Normale, 2014.
• Σειρά: CRM Series ; 18
• Θέματα: Mathematics.; Convex geometry.; Discrete geometry.; Convex and Discrete Geometry.

This book collects some surveys on current trends in discrete mathematics and discrete geometry. The areas covered include:  graph representations, structural graphs theory, extremal graph theory, Ramsey theory and constrained satisfaction problems.

Πίνακας περιεχομένων:

• Imre Bárány: Tensors, colours, octahedral
• Maria Chudnovsky: Cliques and stable sets in undirected graphs
• Mauro Di Nasso: A taste of nonstandard methods in combinatorics of numbers
• Béla Bollobás, Zoltán Füredi, Ida Kantor, G. O. H. Katona and Imre Leader: A coding problem for pairs of subsets
• Jirí Matousek: String graphs and separators
• Jaroslav Nesetril and Patrice Ossona de Mendez: On first-order definable colorings
• Ryan Schwartz and József Solymosi: Combinatorial applications of the subspace theorem
• Peter Hegarty and Dmitry Zhelezov: Can connected commuting graphs of finite groups have arbitrarily large diameter?