Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist

Erdős–Ko–Rado Theorems: Algebraic Approaches

£52.99

Part of Cambridge Studies in Advanced Mathematics

  • Date Published: November 2015
  • availability: In stock
  • format: Hardback
  • isbn: 9781107128446

£ 52.99
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Aimed at graduate students and researchers, this fascinating text provides a comprehensive study of the Erdős–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.

    • Comprehensive look at the EKR Theorem covering many areas and techniques
    • Self-contained chapters and exercises make this text suitable for a graduate course
    • Final chapter outlines open research problems to inspire future research
    Read more

    Reviews & endorsements

    'This is an excellent book about Erdos-Ko-Rado (EKR) Theorems and how to prove them by algebraic methods … The writing style is reader-friendly, and proofs are well organized and easily followed. Also, every chapter contains Exercises and Notes, which are very useful for expanding understanding and finding further reading. The reviewer recommends this book without hesitation to all graduate students and researchers interested in combinatorics.' Norihide Tokushige, MathSciNet

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: November 2015
    • format: Hardback
    • isbn: 9781107128446
    • length: 350 pages
    • dimensions: 235 x 158 x 23 mm
    • weight: 0.62kg
    • contains: 5 b/w illus. 170 exercises
    • availability: In stock
  • Table of Contents

    Preface
    1. The Erdős–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.

  • Authors

    Christopher Godsil, University of Waterloo, Ontario
    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, University of Regina, Saskatchewan, Canada
    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.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×