EXACT FACE-ISOPERIMETRIC INEQUALITIES

被引：15

作者：

BOLLOBAS, B

LEADER, I

机构：

[1] UNIV CAMBRIDGE,DEPT PURE MATH & MATH STAT,CAMBRIDGE,ENGLAND

[2] LOUISIANA STATE UNIV,DEPT MATH,BATON ROUGE,LA 70803

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1990年 / 11卷 / 04期

关键词：

D O I：

10.1016/S0195-6698(13)80135-7

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A d-dimensional face of the grid [k]n = {0, ... , k−s1}n is a set of the form {X ∈ [k]n}:xi=a1..., xi =ad, where 1 ⩽ i1 < … < id ⩽ n and a1, … , ad ∈ [k]. The main aim of this note is to give a best possible upper bound for the number of d-dimensional faces contained in a subset of [k]n of given cardinality, and thereby to prove a conjecture of Bollobás and Radcliffe. © 1990, Academic Press Limited. All rights reserved.

引用

页码：335 / 340

页数：6

共 7 条

[1] MAXIMALLY CONNECTED ARRAYS ON N-CUBE [J].