Covering sets by subsets

descriptionPublicationkeyboard_double_arrow_right Article 01 Dec 1984 Germany English Publisher:Springer Science and Business Media LLCJournal:Monatshefte f�r Mathematik, volume 98, pages 323-329 (issn: 0026-9255, eissn: 1436-5081,

Copyright policy )

Authors: Warlimont, Richard;

doi: 10.1007/bf01540780

Covering sets by subsets

- Summary
- Subjects
- Metrics

Abstract

Let to every element x of a finite set M be associated some nonempty subset M(x) of M in such a way that the implication \(y\in M(x)\Rightarrow x\in M(y)\) is fulfilled. We prove two upper estimations for the least number of sets M(x) which are necessary to cover M. Several applications to number theory are presented.

Country

Germany

Related Organizations

University of Regensburg
Germany
DigiZeitschriften
Germany

Keywords

Permutations, words, matrices, 510.mathematics, covering number, subsets, Combinatorial aspects of packing and covering, Article

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average