𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the divisibility of homogeneous hypergraphs

✍ Scribed by M. El-Zahar; N. Sauer


Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
415 KB
Volume
14
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the divisibility of -SaliΓ© numbers
✍ Yong Zhang; Hao Pan πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 256 KB

We confirm two conjectures of Guo and Zeng on q-SaliΓ© numbers.

On divisibility of binomial coefficients
✍ Marko Razpet πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 141 KB

The Lucas theorem for binomial coefficients implies some interesting tensor product properties of certain matrices regarded for every prime p in the field TP. Let us define the array of numbers C(i,j) for all nonnegative integers i and j by binomial coefficients: ## 0 _i ' We may display the numb

On the divisibility of the cycle number
✍ Linda ValdΓ©s πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 231 KB

For every even p>4, there exists a nonseparable cubic graph G with p vertices, such that the cycle number of G is divisible by 7.

On the minimum size of tight hypergraphs
✍ Jorge L. Arocha; Javier Bracho; Victor Neumann-Lara πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 333 KB

## Abstract A __k__‐graph, __H__ = (__V, E__), is __tight__ if for every surjective mapping __f__: __V__ β†’ {1,….k} there exists an edge Ξ± Ο΅ __E__ sicj tjat __f__|~Ξ±~ is injective. Clearly, 2‐graphs are tight if and only if they are connected. Bounds for the minimum number Ο• of edges in a tight __k_