Geometry, Structure and Randomness in Combinatorics
Author:   Jiří Matousek ,  Jaroslav Nešetřil ,  Marco Pellegrini
Publisher:   Birkhauser Verlag AG
Volume:   18
ISBN:  

9788876425240


Pages:   160
Publication Date:   02 April 2015
Format:   Paperback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $67.95 Quantity:  
Add to Cart

Share |

Geometry, Structure and Randomness in Combinatorics


Add your own review!

Overview

​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.

Full Product Details

Author:   Jiří Matousek ,  Jaroslav Nešetřil ,  Marco Pellegrini
Publisher:   Birkhauser Verlag AG
Imprint:   Scuola Normale Superiore
Volume:   18
Dimensions:   Width: 15.50cm , Height: 1.50cm , Length: 23.50cm
Weight:   0.340kg
ISBN:  

9788876425240


ISBN 10:   8876425241
Pages:   160
Publication Date:   02 April 2015
Audience:   College/higher education ,  Postgraduate, Research & Scholarly
Format:   Paperback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

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?

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now