𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Lower Bound on the Number of Solutions to the Probed Partial Digest Problem

✍ Scribed by L.A. Newberg; D. Naor

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
396 KB
Volume
14
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A lower bound on the independence number
A lower bound on the independence number of arbitrary hypergraphs
✍ Thiele, Torsten πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 104 KB πŸ‘ 3 views

We present a lower bound on the independence number of arbitrary hypergraphs in terms of the degree vectors. The degree vector of a vertex v is given by d is the number of edges of size m containing v. We define a function f with the property that any hypergraph H = (V, E) satisfies Ξ±(H) β‰₯ v∈V f (d

A lower bound on the number of Semi-Bool
A lower bound on the number of Semi-Boolean quadruple systems
✍ Marco Buratti; Alberto Del Fra πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 135 KB πŸ‘ 1 views

## Abstract A Steiner quadruple system of order 2^__n__^ is __Semi‐Boolean__ (SBQS(2^__n__^) in short) if all its derived triple systems are isomorphic to the point‐line design associated with the projective geometry __PG__(__n__βˆ’1, 2). We prove by means of explicit constructions that for any __n__

A lower bound on the number of spanning
A lower bound on the number of spanning trees with k end-vertices
✍ Katherine Heinrich; Guizhen Liu πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 286 KB πŸ‘ 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span