libri scuola books Fumetti ebook dvd top ten sconti 0 Carrello


Torna Indietro

godsil christopher; meagher karen - erdos–ko–rado theorems: algebraic approaches
Zoom

Erdos–Ko–Rado Theorems: Algebraic Approaches Algebraic Approaches

;




Disponibilità: Normalmente disponibile in 20 giorni
A causa di problematiche nell'approvvigionamento legate alla Brexit sono possibili ritardi nelle consegne.


PREZZO
92,98 €
NICEPRICE
88,33 €
SCONTO
5%



Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.


Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente


Facebook Twitter Aggiungi commento


Spese Gratis

Dettagli

Genere:Libro
Lingua: Inglese
Pubblicazione: 11/2015





Trama

Graduate text focusing on algebraic methods that can be applied to prove the Erdos-Ko-Rado Theorem and its generalizations.




Note Editore

Aimed at graduate students and researchers, this fascinating text provides a comprehensive study of the Erdos–Ko–Rado Theorem, with a focus on algebraic methods. The authors begin by discussing well-known proofs of the EKR bound for intersecting families. The natural generalization of the EKR Theorem holds for many different objects that have a notion of intersection, and the bulk of this book focuses on algebraic proofs that can be applied to these different objects. The authors introduce tools commonly used in algebraic graph theory and show how these can be used to prove versions of the EKR Theorem. Topics include association schemes, strongly regular graphs, the Johnson scheme, the Hamming scheme and the Grassmann scheme. Readers can expand their understanding at every step with the 170 end-of-chapter exercises. The final chapter discusses in detail 15 open problems, each of which would make an interesting research project.




Sommario

Preface; 1. The Erdos–Ko–Rado Theorem; 2. Bounds on cocliques; 3. Association schemes; 4. Distance-regular graphs; 5. Strongly regular graphs; 6. The Johnson scheme; 7. Polytopes; 8. The exact bound; 9. The Grassmann scheme; 10. The Hamming scheme; 11. Representation theory; 12. Representations of symmetric group; 13. Orbitals; 14. Permutations; 15. Partitions; 16. Open problems; Glossary of symbols; Glossary of operations and relations; References; Index.




Autore

Christopher Godsil is a professor in the Combinatorics and Optimization Department at the University of Waterloo, Ontario. He authored (with Gordon Royle) the popular textbook Algebraic Graph Theory. He started the Journal of Algebraic Combinatorics in 1992 and he serves on the editorial board of a number of other journals, including the Australasian Journal of Combinatorics and the Electronic Journal of Combinatorics.
Karen Meagher is an associate professor in the Department of Mathematics and Statistics at the University of Regina, Saskatchewan, Canada. Her research area is graph theory and discrete mathematics in which she has published around 25 journal articles.










Altre Informazioni

ISBN:

9781107128446

Condizione: Nuovo
Collana: Cambridge Studies in Advanced Mathematics
Dimensioni: 235 x 23 x 158 mm Ø 620 gr
Formato: Copertina rigida
Illustration Notes:5 b/w illus. 170 exercises
Pagine Arabe: 350


Dicono di noi