Geometry, Structure and Randomness in Combinatorics de Jiří Matousek

Geometry, Structure and Randomness in Combinatorics: Publications of the Scuola Normale Superiore, cartea 18

Jiří Matousek

Jaroslav Nešetřil

Marco Pellegrini

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.

Citește tot Restrânge

Din seria Publications of the Scuola Normale Superiore

Preț: 110^.05 lei
Preț: 210^.70 lei
Preț: 183^.28 lei
Preț: 179^.18 lei
Preț: 108^.14 lei
Preț: 152^.89 lei
Preț: 162^.30 lei
Preț: 255^.18 lei
20%

Preț: 93^.35 lei
Preț: 216^.87 lei
Preț: 216^.22 lei
Preț: 173^.37 lei
Preț: 186^.15 lei
Preț: 182^.07 lei
Preț: 349^.91 lei
Preț: 155^.83 lei
Preț: 218^.42 lei
Preț: 177^.23 lei
Preț: 183^.00 lei
Preț: 256^.05 lei
Preț: 209^.46 lei
Preț: 204^.17 lei
Preț: 280^.97 lei
$Fractional Elliptic Problems with Critical Growth in the Whole of $\R^n$$

Preț: 279^.98 lei
Preț: 186^.86 lei
Preț: 286^.47 lei
Preț: 216^.43 lei
Preț: 183^.98 lei
Preț: 213^.42 lei
Preț: 182^.07 lei
Preț: 290^.71 lei
Preț: 196^.88 lei
Preț: 277^.22 lei
Preț: 144^.99 lei
Preț: 143^.05 lei
Preț: 189^.33 lei
Preț: 161^.84 lei
Preț: 197^.03 lei
Preț: 194^.74 lei
Preț: 249^.88 lei
Preț: 206^.58 lei
Preț: 213^.05 lei
Preț: 158^.06 lei
Preț: 268^.64 lei
Preț: 107^.55 lei
Preț: 67^.56 lei
Preț: 140^.42 lei
Preț: 101^.75 lei
29%

Preț: 45^.40 lei

Specificații

ISBN-13: 9788876425240
ISBN-10: 8876425241
Pagini: 160
Ilustrații: Approx. 160 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.34 kg
Ediția:2014
Editura: Scuola Normale Superiore
Colecția Edizioni della Normale
Seriile Publications of the Scuola Normale Superiore, CRM Series

Locul publicării:Pisa, Switzerland

Cuprins

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?