✦ LIBER ✦

On the maximum number of balancing subsets

✍ Scribed by Seiji Nabeya

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 156 KB
Volume: 13
Category: Article
ISSN: 0304-4068
DOI: 10.1016/0304-4068(84)90011-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the number of latent subsets of inter

On the number of latent subsets of intersecting collections

✍ D.J. Kleitman; T.L. Magnanti 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 291 KB

On the maximum number of decoherent hist

On the maximum number of decoherent histories

✍ Lajos Diósi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 154 KB

On circles containing the maximum number

On circles containing the maximum number of points

✍ J. Akiyama; Y. Ishigami; M. Urabe; J. Urrutia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 133 KB

We define B(x, y) to be the disk in the plane which has the points x,y as its diametral end points. Let liB(n) [or/Tn(n)] be the largest number such that for every set [or every convex set]P of n points in R 2, there exist two points x,y ~ P for which B(x,y) contains liB(n) [or hB(n)] points of P. W

On graphs with the maximum number of spa

On graphs with the maximum number of spanning trees

✍ Alexander K. Kelmans 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

Let 3:; denote the set of simple graphs with n vertices and m edges, t ( G ) the number of spanning trees of a graph G , and F 2 H if t(K,\E(F))?t(K,\E(H)) for every s? max{u(F), u ( H ) } . We give a complete characterization of >-maximal (maximum) graphs in 3:; subject to m 5 n . This result conta

On the maximum number of disjoint Steine

On the maximum number of disjoint Steiner triple systems

✍ Luc Teirlinck 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let D(u) be the maximum number of pairwk disjoint Steiner triple sysiems of order v. We prove that D(3v:r 2 2v + D(v) for every u = 1 oi 3 (mod 6), u 2 3. As a corollary, we have D(3n) -3n-2 for every n 2 1.

On the maximum number of pairwise compat

On the maximum number of pairwise compatible euler cycles

✍ H. Fleischner; A. J. W. Hilton; Bill Jackson 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 629 KB

## Abstract B. Jackson [4] made the following conjecture: If __G__ is an Eulerian graph with δ(__G__) ≥ 2__k__, then __G__ has a set of 2__k__ ‐ 2 pairwise compatible Euler cycles (i.e., every pair of adjacent edges appears in at most one of these Euler cycles as a pair of consecutive edges). We ve