Cargando…

Geometry, Structure and Randomness in Combinatorics

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.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Matousek, Jiří (Editor ), Nešetřil, Jaroslav (Editor ), Pellegrini, Marco (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Pisa : Scuola Normale Superiore : Imprint: Edizioni della Normale, 2014.
Edición:1st ed. 2014.
Colección:CRM Series, 18
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-88-7642-525-7
003 DE-He213
005 20220118211345.0
007 cr nn 008mamaa
008 150409s2014 it | s |||| 0|eng d
020 |a 9788876425257  |9 978-88-7642-525-7 
024 7 |a 10.1007/978-88-7642-525-7  |2 doi 
050 4 |a QA639.5-640.7 
050 4 |a QA640.7-640.77 
072 7 |a PBM  |2 bicssc 
072 7 |a PBD  |2 bicssc 
072 7 |a MAT012020  |2 bisacsh 
072 7 |a PBM  |2 thema 
072 7 |a PBD  |2 thema 
082 0 4 |a 516  |2 23 
245 1 0 |a Geometry, Structure and Randomness in Combinatorics  |h [electronic resource] /  |c edited by Jiří Matousek, Jaroslav Nešetřil, Marco Pellegrini. 
250 |a 1st ed. 2014. 
264 1 |a Pisa :  |b Scuola Normale Superiore :  |b Imprint: Edizioni della Normale,  |c 2014. 
300 |a Approx. 160 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a CRM Series,  |x 2532-3326 ;  |v 18 
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? 
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. 
650 0 |a Convex geometry . 
650 0 |a Discrete geometry. 
650 1 4 |a Convex and Discrete Geometry. 
700 1 |a Matousek, Jiří.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Nešetřil, Jaroslav.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Pellegrini, Marco.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9788876425240 
830 0 |a CRM Series,  |x 2532-3326 ;  |v 18 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-88-7642-525-7  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)