Graduate text focusing on algebraic methods that can be applied to prove the Erdős–Ko–Rado Theorem and its generalizations.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Studibuch, Stuttgart, Deutschland
hardcover. Zustand: Sehr gut. 375 Seiten; 9781107128446.2 Gewicht in Gramm: 1. Artikel-Nr. 1037117
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9781107128446_new
Anzahl: Mehr als 20 verfügbar
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
Hardcover. Zustand: Brand New. 335 pages. 9.00x6.00x1.00 inches. In Stock. Artikel-Nr. x-1107128447
Anzahl: 2 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. Graduate text focusing on algebraic methods that can be applied to prove the Erdos-Ko-Rado Theorem and its generalizations. Series: Cambridge Studies in Advanced Mathematics. Num Pages: 375 pages, 5 b/w illus. 170 exercises. BIC Classification: PBD; PBF; PBV. Category: (P) Professional & Vocational. Dimension: 228 x 152. . . 2015. Hardcover. . . . . Books ship from the US and Ireland. Artikel-Nr. V9781107128446
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9781107128446
Anzahl: 1 verfügbar