๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Sharp Bound for the Number of Sets that Pairwise Intersect atkPositive Values

โœ Scribed by HunterS. Snevily

Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
146 KB
Volume
23
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A sharp upper bound for the number of st
A sharp upper bound for the number of stable sets in graphs with given number of cut edges
โœ Hongbo Hua ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.

On a sharp bound for the regularity inde
On a sharp bound for the regularity index of any set of fat points
โœ Giuliana Fatabbi; Anna Lorenzini ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 178 KB

We propose an upper bound for the regularity index of fat points of P n with no geometric conditions on the points. Whenever the conjecture is true, the bound is sharp. It is, in fact, reached when there are points with high multiplicities either on a line or on some rational curve. Besides giving a