On \(abab\)-free and \(abba\)-free set partitions
type: Item
instance of: scholarly article
title: On \(abab\)-free and \(abba\)-free set partitions
zbMATH Open document ID: 0840.05004
author: Martin Klazar
published in: European Journal of Combinatorics
publication date: 1996-06-27T00:00:00Z
Mathematics Subject Classification ID: 05A18
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A10
zbMATH DE Number: 847630
zbMATH Keywords: set partitions
zbMATH Keywords: sequential form
zbMATH Keywords: alphabet
zbMATH Keywords: noncrossing partitions
zbMATH Keywords: blocks
zbMATH Keywords: pattern
zbMATH Keywords: Davenport-Schinzel sequences
zbMATH Keywords: generating function
zbMATH Keywords: extremal problems
MaRDI profile type: Publication
full work available at URL: eujc.1996.0005
OpenAlex ID: W2023353776
DOI: 10.1006/EUJC.1996.0005
Recommended article: Path partitions and \(P_{n}\)-free sets
Recommended article: Q3377544
Recommended article: A bijection between nonnegative words and sparse \(abba\)-free partitions
Recommended article: Partitioning the power set of \([n]\) into \(C_k\)-free parts
Recommended article: Q5272789
Recommended article: Partition-free families of sets
Recommended article: Partition‐free families of sets
Recommended article: Counting pattern-free set partitions. II: Noncrossing and other hypergraphs
Recommended article: On singletons and adjacencies of set partitions
Recommended article: Q5869463
description: scientific article; zbMATH DE number 847630