Density theorems for finitistic trees

descriptionPublicationkeyboard_double_arrow_right Article 01 Sep 1983 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 3, pages 305-313 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: Ralf Bicker; Bernd Voigt;

doi: 10.1007/bf02579186

Density theorems for finitistic trees

- Summary
- Subjects
- Metrics

Abstract

This paper investigates to what extent, the Milliken partition theorem for finitistic trees is a density result.

Related Organizations

Bielefeld University
Germany

Keywords

Permutations, words, matrices, Combinatorial aspects of partitions of integers, Partial orders, general, strongly embedded subtree, Milliken partition theorem, positive upper density, finitistic tree, Trees

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).	5
	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).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average