Sperner properties for groups and relations
type: Item
instance of: scholarly article
title: Sperner properties for groups and relations
zbMATH Open document ID: 0617.08001
DOI: 10.1016/S0195-6698(86)80007-5
author: Maurice Pouzet
author: Ivo G. Rosenberg
published in: European Journal of Combinatorics
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 08A02
Mathematics Subject Classification ID: 06A06
Mathematics Subject Classification ID: 03E20
Mathematics Subject Classification ID: 20B05
zbMATH DE Number: 4000002
zbMATH Keywords: blocks
zbMATH Keywords: natural order
zbMATH Keywords: permutation group
zbMATH Keywords: strong Sperner property
zbMATH Keywords: equivalence classes
zbMATH Keywords: isomorphism types of restrictions
zbMATH Keywords: embeddability order
MaRDI profile type: Publication
cites work: Q4055670
cites work: A generalization of Sperner's lemma
cites work: Permutation groups on unordered sets
cites work: Q5805073
cites work: Transitivity of permutation groups on unordered sets
cites work: On a lemma of Littlewood and Offord
cites work: Q5791702
cites work: Q5628126
cites work: Q5628127
cites work: Quelques problèmes combinatoires concernant les ordres totaux et les rélations monomorphes
cites work: Q4049073
cites work: An application of Dilworth's lattice of maximal antichains
cites work: Q4165427
cites work: The structure of Sperner k-families
cites work: Some partitions associated with a partially ordered set
cites work: On chains and Sperner k-families in ranked posets
cites work: On chains and Sperner k-families in ranked posets. II
cites work: Parallel concepts in graph theory
cites work: On incidence matrices of finite projective and affine spaces
cites work: Q5581642
cites work: Transitivity of finite permutation groups on unordered sets
cites work: A short proof of Sperner's lemma
cites work: Q5331504
cites work: Q5668845
cites work: Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
cites work: Application de la Notion de Relation Presque‐Enchainable au Denombrement des Restrictions Finies D'une Relation
cites work: Note on a theorem of Livingstone and Wagner
cites work: Q5616860
cites work: A short proof of the existence of k-saturated partitions of partially ordered sets
cites work: Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
cites work: A symmetric chain decomposition of L(4,n)
cites work: Endliche \(k\)-homogene Permutationsgruppen
cites work: A partition of L(3,n) into saturated symmetric chains
full work available at URL: s0195-6698(86)80007-5
OpenAlex ID: W2036664965
description: scientific article; zbMATH DE number 4000002