Geometry, structure and randomness in combinatorics / edited by Ji?í Matoušek, Jaroslav Nešet?il, Marco Pellegrini.
Tipo de material:
TextoSeries CRM Series ; 18Editor: Pisa : Scuola Normale Superiore : Imprint: Edizioni della Normale, 2014Descripción: Approx. 160 páginasTipo de contenido: - texto
- computadora
- recurso en línea
- 9788876425257
- QA639.5-640.7
Contenidos:
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?
No hay ítems correspondientes a este registro
Springer eBooks
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?
Para consulta fuera de la UANL se requiere clave de acceso remoto.