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).
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:494448 |
| Date | January 2008 |
| Creators | Spencer, Claire Lucy |
| Publisher | University of Reading |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
Page generated in 0.0021 seconds