Use this URL to cite or link to this record in EThOS: | https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.494448 |
![]() |
|||||
Title: | A generalization of Talbot's theorem about King Arthur and the Knights of the Round Table | ||||
Author: | Spencer, Claire Lucy |
ISNI:
0000 0001 3474 1796
|
|||
Awarding Body: | UNIVERSITY OF READING | ||||
Current Institution: | University of Reading | ||||
Date of Award: | 2008 | ||||
Availability of Full Text: |
|
||||
Abstract: | |||||
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).
|
|||||
Supervisor: | Not available | Sponsor: | Not available | ||
Qualification Name: | Thesis (Ph.D.) | Qualification Level: | Doctoral | ||
EThOS ID: | uk.bl.ethos.494448 | DOI: | Not available | ||
Keywords: | Set theory | ||||
Share: |