product iamge

Geometry, Structure and Randomness in Combinatorics

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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

Author(s): Jiří Matoušek, Jaroslav Nešetřil, Marco Pellegrini (eds.)
Series: CRM Series 18
Edition: 1
Publisher: Edizioni della Normale
Year: 2014

Language: English
Pages: 0
Tags: Convex and Discrete Geometry

Front Matter....Pages i-xiv
Tensors, colours, octahedra....Pages 1-17
Cliques and stable sets in undirected graphs....Pages 19-25
A taste of nonstandard methods in combinatorics of numbers....Pages 27-46
A coding problem for pairs of subsets....Pages 47-59
String graphs and separators....Pages 61-97
On first-order definable colorings....Pages 99-122
Combinatorial applications of the subspace theorem....Pages 123-140
Can connected commuting graphs of finite groups have arbitrarily large diameter?....Pages 141-144
Back Matter....Pages 145-148