✦ LIBER ✦

On partitioning integers into progression free sets

✍ Scribed by H.L Abbott; A.C Liu

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 204 KB
Volume: 13
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(72)90076-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning a power set into union-free

Partitioning a power set into union-free classes

✍ Martin Aigner; Dwight Duffus; Daniel J. Kleitman 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 353 KB

Aigner, M., D. Duffus and D.J. Kleitman, Partitioning a power set into union-free classes, Discrete Mathematics 88 (1991) 113-119. Two problems involving union-free colorings of the set of all subsets of an n-set are considered, with bounds obtained for minimum colorings. ## any integer n let g(n)

On abab-free and abba-free Set Partition

On abab-free and abba-free Set Partitions

✍ Martin Klazar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 341 KB

These are partitions of [ l ] ϭ ͕ 1 , 2 , . . . , l ͖ into n blocks such that no four-term subsequence of [ l ] induces the mentioned pattern and each k consecutive numbers of [ l ] fall into dif ferent blocks . These structures are motivated by Davenport -Schinzel sequences . We summarize and exten

Partitions of graphs into one or two ind

Partitions of graphs into one or two independent sets and cliques

✍ Andreas Brandstädt 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 417 KB

It is shown in this note that it can be recognized in polynomial time whether the vertex set of a finite undirected graph can be partitioned into one or two independent sets and one or two cliques. Such graphs generalize bipartite and split graphs and the result also shows that it can be recognized