Partitioning Subwords of Long Words

DOI10.1016/S0304-0208(08)73397-8zbMath0533.05006MaRDI QIDQ3315512

Walter A. Deuber

Publication date: 1983

Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

finite alphabetinfinite subsetset of all subwords

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Density, gaps, topology (11B05)

Related Items (1)

Density versions of two generalizations of Schur's theorem

This page was built for publication: Partitioning Subwords of Long Words