Consider a graph \(G\) with the property that any set of \(p\) vertices in \(G\) contains a \(q\)-clique. Fairly tight lower bounds are proved on the clique number of \(G\) as a function of \(p, q\) and the number of vertices in \(G\). 1994 Academic Press, Inc.
Local and global proportionality
β Scribed by D.R. Woodall
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 805 KB
- Volume
- 102
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Woodall, D.R., Local and global proportionality, Discrete Mathematics 102 (1992) 315-328. The problem considered here is that posed by Fishburn, Hwang and Lee concerning the proportion of elements of one colour in a 2-coloured ring. It is required to deduce global information about this proportion from rather restricted local information. The problem is more or less solved for simple rings, some bounds are obtained in general, and conjectures are made concerning both the original problem and its generalizations to different sorts of graph.
π SIMILAR VOLUMES
In this article we recall the interesting problem about local and global proportionalities in ball rings posed by Fishburn et al. (1986). For the symmetric neighborhood case, we decrease the upper bounds (which were conjectured to be tight) by giving a uniform construction for the three subcases dis