Location: EU Supported » PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning » 6th Slovenian International Conference on Graph Theory, Bled 2007

Erdös-Ko-Rado theorems

author: Chris Godsil, Combinatorics and Optimization Department, University of Waterloo
published: Sept. 7, 2007,   recorded: September 2007,   views: 6176
Categories

See Also:

Download slides icon Download slides: sicgt07_godsil_ekrt_01.pdf (391.7 KB)

Help icon Streaming Video Help

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

I will show that this theorem has a natural proof using linear algebra, and that this approach also applies to situations where sets are replaced by objects such as subspaces, permutations or partitions.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: