Graduate text focusing on algebraic methods that can be applied to prove the Erdős–Ko–Rado Theorem and its generalizations.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: GreatBookPrices, Columbia, MD, U.S.A.
Condizione: New. Codice articolo 23944214-n
Quantità: Più di 20 disponibili
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: new. Hardcover. Aimed at graduate students and researchers, this fascinating text provides a comprehensive study of the ErdosKoRado 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. The ErdosKoRado Theorem is a fundamental result in combinatorics. Aimed at graduate students and researchers, this comprehensive text shows how tools from algebraic graph theory can be applied to prove the EKR Theorem and its generalizations. Readers can test their understanding at every step with the end-of-chapter exercises. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Codice articolo 9781107128446
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9781107128446_new
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9781107128446
Quantità: Più di 20 disponibili
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Condizione: New. Codice articolo 23944214-n
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 335 pages. 9.00x6.00x1.00 inches. In Stock. This item is printed on demand. Codice articolo __1107128447
Quantità: 1 disponibili
Da: Studibuch, Stuttgart, Germania
hardcover. Condizione: Sehr gut. 375 Seiten; 9781107128446.2 Gewicht in Gramm: 1. Codice articolo 1037117
Quantità: 1 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9781107128446
Quantità: Più di 20 disponibili
Da: Rarewaves.com USA, London, LONDO, Regno Unito
Hardback. Condizione: New. Illustrated. 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. Codice articolo LU-9781107128446
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: new. Hardcover. 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. The ErdosKoRado Theorem is a fundamental result in combinatorics. Aimed at graduate students and researchers, this comprehensive text shows how tools from algebraic graph theory can be applied to prove the EKR Theorem and its generalizations. Readers can test their understanding at every step with the end-of-chapter exercises. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9781107128446
Quantità: 1 disponibili