東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Erdős-Ko-Rado theorems = algebraic ...

Godsil, C. D. (1949-)

Linked to FindBook

Google Book

Amazon

博客來

Erdős-Ko-Rado theorems = algebraic approaches /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Erdős-Ko-Rado theorems/ Chris Godsil, Karen Meagher.
Reminder of title:	algebraic approaches /
Author:	Godsil, C. D.
other author:	Meagher, Karen
Published:	Cambridge :Cambridge University Press, : 2016.,
Description:	xvi, 335 p. :ill., digital ;24 cm.
Notes:	Title from publisher's bibliographic system (viewed on 10 Dec 2015).
Subject:	Intersection theory. -
Online resource:	https://doi.org/10.1017/CBO9781316414958
ISBN:	9781316414958

Erdős-Ko-Rado theorems = algebraic approaches /
Godsil, C. D.1949-

Erdős-Ko-Rado theoremsalgebraic approaches /[electronic resource] :Chris Godsil, Karen Meagher. - Cambridge :Cambridge University Press,2016. - xvi, 335 p. :ill., digital ;24 cm. - Cambridge studies in advanced mathematics ;149. - Cambridge studies in advanced mathematics ;149..

Title from publisher's bibliographic system (viewed on 10 Dec 2015).

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.

ISBN: 9781316414958Subjects--Topical Terms:

698418
Intersection theory.

LC Class. No.: QA564 / .G64 2016

Dewey Class. No.: 512

Erdős-Ko-Rado theorems = algebraic approaches /
LDR:01833nmm a2200265 a 4500 001 2227282
003 UkCbUP
005 20160210160009.0
006 m d
007 cr nn 008maaau
008 210414s2016 enk o 1 0 eng d
020 $a 9781316414958 $q (electronic bk.)
020 $a 9781107128446 $q (hardback)
035 $a CR9781316414958
040 $a UkCbUP $b eng $c UkCbUP $d GP
041 0 $a eng
050 4 $a QA564 $b .G64 2016
082 0 4 $a 512 $2 23
090 $a QA564 $b .G589 2016
100 1 $a Godsil, C. D. $q (Christopher David), $d 1949- $3 3470610
245 1 0 $a Erdős-Ko-Rado theorems $h [electronic resource] : $b algebraic approaches / $c Chris Godsil, Karen Meagher.
260 $a Cambridge : $b Cambridge University Press, $c 2016.
300 $a xvi, 335 p. : $b ill., digital ; $c 24 cm.
490 1 $a Cambridge studies in advanced mathematics ; $v 149
500 $a Title from publisher's bibliographic system (viewed on 10 Dec 2015).
520 $a 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.
650 0 $a Intersection theory. $3 698418
650 0 $a Hypergraphs. $3 1638774
650 0 $a Combinatorial analysis. $3 523878
700 1 $a Meagher, Karen $c (College teacher) $3 3470611
830 0 $a Cambridge studies in advanced mathematics ; $v 149. $3 3470612
856 4 0 $u https://doi.org/10.1017/CBO9781316414958