𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Inequality on the Size of a Set in a Cartesian Product

✍ Scribed by H. Maehara

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
136 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

Let be a finite subset of the Cartesian product W 1 Γ— β€’ β€’ β€’ Γ— W n of n sets. For A βŠ‚ {1, 2, . . . , n}, denote by A the projection of onto the Cartesian product of W i , i ∈ A. Generalizing an inequality given in an article by Shen, we prove that , 2, . . . , n}. This inequality is applied to give some bounds on the numbers of special subgraphs of a graph.

πŸ“œ SIMILAR VOLUMES

Equality and Coequality Relations on the
Equality and Coequality Relations on the Cartesian Product of Sets
✍ Daniel A. Romano πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 433 KB

EQUALITY AND COEQUALITY RELATIONS ON THE CARTESIAN PRODUCT O F SETS by DANEL A . ROMANO in Bihac (Yugoslavia) ## 0. Introduction The foundations on constructive mathematics, in BISHOP'S sense [l], rest on and comprise the three primitive notions of numbers, classes and computations. We believe tha

On the Size of a Double Blocking Set inP
On the Size of a Double Blocking Set inPG(2,q)
✍ Simeon Ball; Aart Blokhuis πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 212 KB

We obtain lower bounds for the size of a double blocking set in the Desarguesian projective plane PG(2, q). These bounds are best possible for q Ο½ 11 and in the case q is a square. With the same technique we also exclude certain values for the size of an ordinary minimal blocking set.

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, Ο‰(__G__), of a maximum clique in __G__ sat