Surveys in Combinatorics 2021
Editat de Daniel Paulusma, George B. Mertzios, Konrad K. Dabrowski, Matthew Johnson, Maximilien Gadouleau, Nicholas Georgiouen Limba Engleză Paperback – 24 iun 2021
Preț: 506.33 lei
Preț vechi: 550.35 lei
-8%
Puncte Express: 759
Preț estimativ în valută:
89.61€ • 104.73$ • 77.80£
89.61€ • 104.73$ • 77.80£
Carte disponibilă
Livrare economică 29 ianuarie-12 februarie
Livrare express 15-21 ianuarie pentru 542.93 lei
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781009018883
ISBN-10: 1009018884
Pagini: 378
Dimensiuni: 229 x 153 x 24 mm
Greutate: 0.56 kg
Editura: Cambridge University Press
Locul publicării:Cambridge, United Kingdom
ISBN-10: 1009018884
Pagini: 378
Dimensiuni: 229 x 153 x 24 mm
Greutate: 0.56 kg
Editura: Cambridge University Press
Locul publicării:Cambridge, United Kingdom
Cuprins
1. The partition complex: an invitation to combinatorial commutative algebra Karim Adiprasito and Geva Yashfe; 2. Hasse-Weil type theorems and relevant classes of polynomial functions Daniele Bartoli; 3. Decomposing the edges of a graph into simpler structures Marthe Bonamy; 4. Generating graphs randomly Catherine Greenhill; 5. Recent advances on the graph isomorphism problem Martin Grohe and Daniel Neuen; 6. Extremal aspects of graph and hypergraph decomposition problems Stefan Glock, Daniela Kühn and Deryk Osthus; 7. Borel combinatorics of locally finite graphs Oleg Pikhurko; 8. Codes and designs in Johnson graphs with high symmetry Cheryl E. Praeger; 9. Maximal subgroups of finite simple groups: classifications and applications Colva M. Roney-Dougal.
Descriere
These nine articles provide up-to-date surveys of topics of contemporary interest in combinatorics.