Erdos-Ko-Random theorems : algebraic approaches

By:

Godsil, Christopher David [Author]

Contributor(s):

Meagher, Karen [Author]

Material type: Text

9781107128446

Subject(s):

DDC classification:

512 GOD / B

Online resources:

Table of contents

Summary: The Erdos-Ko-Rado 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.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Current library	Collection	Call number	Status	Date due	Barcode
Book	IIT - Dharwad	MAT	512 GOD / B (Browse shelf(Opens below))	Available		4577

Browsing IIT - Dharwad shelves Close shelf browser (Hides shelf browser)

Previous					No cover image available	No cover image available		Next
Previous	512 FAR / B-II A graduate course in algebra (volume II)	512 GAN / B Moonshine beyond the monster :	512 GAN / B Moonshine beyond the monster :	512 GOD / B Erdos-Ko-Random theorems :	512 HAL / G Higher algebra	512 HAL / G Higher algebra	512 HER / B Topics in algebra	Next

Includes bibliographical references and index.

The Erdos-Ko-Rado 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.

There are no comments on this title.

to post a comment.