A generalization of Talbot's theorem about King Arthur and the Knights of the Round Table
A theorem of Talbot, stated in terms of graph theory, is as follows: Let G be a cycle on n vertices raised to the power k > 1. If A is a family of intersecting independent r-subsets of the vertices of G where r > 1 and n > (k: + 1)r then [A] < (n-kr-1 / r-1).
| Main Author: | |
|---|---|
| Published: |
University of Reading
2008
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.494448 |