---

＜E-Book＞
Geometry, Structure and Randomness in Combinatorics / edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini
(CRM Series. ISSN:25323326 ; 18)

Edition	1st ed. 2014.
Publisher	(Pisa : Scuola Normale Superiore : Imprint: Edizioni della Normale)
Year	2014
Size	Approx. 160 p : online resource
Authors	Matousek, Jiří editor Nešetřil, Jaroslav editor Pellegrini, Marco editor SpringerLink (Online service)
Subjects	LCSH:Convex geometry  LCSH:Discrete geometry FREE:Convex and Discrete Geometry
Notes	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? 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 HTTP:URL=https://doi.org/10.1007/978-88-7642-525-7

 Similar Items