✦ LIBER ✦

Some intersection theorems for ordered sets and graphs

✍ Scribed by F.R.K Chung; R.L Graham; P Frankl; J.B Shearer

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 642 KB
Volume: 43
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(86)90019-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Intersection theorems for some noncommut

Intersection theorems for some noncommutative noetherian rings

✍ William Schelter 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 367 KB

An intersection theorem for systems of s

An intersection theorem for systems of sets

✍ A. V. Kostochka 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB 👁 2 views

Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists

Set intersection representations for alm

Set intersection representations for almost all graphs

✍ Eaton, Nancy; Grable, David A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

Two variations of set intersection representation are investigated and upper and lower bounds on the minimum number of labels with which a graph may be represented are found that hold for almost all graphs. Specifically, if &(G) is defined to be the minimum number of labels with which G may be repre

Representation theorems for graphs whose

Representation theorems for graphs whose the vertex set is partially ordered

✍ Alain Quilliot 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 768 KB

## Dedicated to E. Corominas Given a graph G =(X, E), we try to know when it is possible to consider G as the intersection graph of a finite hypergraph, when some restrietions are given on the inclusion order induced on the edge set of this hypergraph. We give some examples concerning the interva

Gallai theorems for graphs, hypergraphs,

Gallai theorems for graphs, hypergraphs, and set systems

✍ E.J. Cockayne; S.T. Hedetniemi; R. Laskar 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 750 KB

Some theorems on graphs and posets

✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 800 KB

In this journal, Lcclerc proved that the dimension of the partiailly ordered slet consisting of all subf~ce'~ of a tree T, m&red by inclusion, is the number of end yuints of 'I'. Leclerc posed the probkrn of determitAng the dimension the partially ed set P consisting of all inducxxI connected subgra