✦ LIBER ✦

A set intersection problem

✍ Scribed by R.A. Brualdi; R.F. Shanny

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 229 KB
Volume: 9
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(74)90032-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Set intersection matrices

✍ H.J Ryser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 789 KB

On set intersections

✍ László Babai; Péter Frankl 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 118 KB

Cycles intersecting a prescribed vertex

Cycles intersecting a prescribed vertex set

✍ Atsushi Kaneko; Akira Saito 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 425 KB

## Abstract A graph is said to have property __P__(__k,l__)(__k__ ⩾ __l__) if for any __X__ ∈ (^__G__^~__k__~) there exists a cycle such that |__X__ ∩ __V__(__C__)| = __l.__ Obviously an __n__‐connected graph (__n__ ⩾ 2) satisfies __P__(__n,n__). In this paper, we study parameters __k__ and __l__ s

On set-theoretic intersections

✍ Gennady Lyubeznik 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 395 KB

Matrices and set intersections

✍ H.J. Ryser 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 456 KB

On set intersection representations of g

On set intersection representations of graphs

✍ Stasys Jukna 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB 👁 1 views

## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~⊆{1, …, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only