|
|
|
|
| LEADER |
01924nmm a2200301 u 4500 |
| 001 |
EB001030598 |
| 003 |
EBX01000000000000000824151 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
150508 ||| eng |
| 020 |
|
|
|a 9788876425257
|
| 100 |
1 |
|
|a Matousek, Jiří
|e [editor]
|
| 245 |
0 |
0 |
|a Geometry, Structure and Randomness in Combinatorics
|h Elektronische Ressource
|c edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini
|
| 250 |
|
|
|a 1st ed. 2014
|
| 260 |
|
|
|a Pisa
|b Scuola Normale Superiore
|c 2014, 2014
|
| 300 |
|
|
|a Approx. 160 p
|b online resource
|
| 505 |
0 |
|
|a 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?
|
| 653 |
|
|
|a Convex and Discrete Geometry
|
| 653 |
|
|
|a Convex geometry
|
| 653 |
|
|
|a Discrete geometry
|
| 700 |
1 |
|
|a Nešetřil, Jaroslav
|e [editor]
|
| 700 |
1 |
|
|a Pellegrini, Marco
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b Springer
|a Springer eBooks 2005-
|
| 490 |
0 |
|
|a CRM Series
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-88-7642-525-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 516.1
|
| 520 |
|
|
|a 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
|