Magnifying Glass
Search Loader

Jiří Matousek & Jaroslav Nešetřil 
Geometry, Structure and Randomness in Combinatorics 

Support
​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.
€28.88
payment methods

Table of Content

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?
Language English ● Format PDF ● Pages 160 ● ISBN 9788876425257 ● File size 2.0 MB ● Editor Jiří Matousek & Jaroslav Nešetřil ● Publisher Edizioni della Normale ● City Pisa ● Country CH ● Published 2015 ● Downloadable 24 months ● Currency EUR ● ID 4134678 ● Copy protection Social DRM

More ebooks from the same author(s) / Editor

876 Ebooks in this category