Hook-free colorings and a problem of Hanson

DOI10.1007/BF02122795zbMath0709.05004OpenAlexW2053744354MaRDI QIDQ920999

Martin Aigner, Daniel Grieser

Publication date: 1988

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02122795

zbMATH Keywords

hook-free coloring numbersubset colouring

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Enumerative combinatorics (05A99) Ramsey theory (05D10)

Related Items (1)

Partitioning a power set into union-free classes

Cites Work

• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Hook-free colorings and a problem of Hanson