An inequality on the size of a set in a Cartesian product (Q1864617)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An inequality on the size of a set in a Cartesian product |
scientific article; zbMATH DE number 1884187
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An inequality on the size of a set in a Cartesian product |
scientific article; zbMATH DE number 1884187 |
Statements
An inequality on the size of a set in a Cartesian product (English)
0 references
18 March 2003
0 references
The author studies an inequality for the size of a given projected subset of a finite Cartesian product. This inequality is obtained by generalizing an inequality of \textit{A. Shen} [Cliques, the Cauchy inequality, and information theory, Intelligencer 22, 14-15 (2000)]. By means of this inequality, it is possible to obtain some bounds on the number of special subgraphs of a given graph.
0 references
Cartesian product
0 references
inequality
0 references
graphs
0 references
0.7185201048851013
0 references
0.7180199027061462
0 references
0.7053231596946716
0 references
0.6994580626487732
0 references