Generating boxes from ordered sets and graphs

DOI10.1007/BF00814404MaRDI QIDQ1803662zbMATH OpenFDO

Authors Maurice Pouzet, Nejib Zaguia, R. E. Woodrow

Publication date 29 June 1993

Published in Order (Search for Journal in Brave)

zbMATH Keywords

transversalcliquepermutation grouptransitive groupantichainchainboxesnondeterministic automaton\(N\)-free ordered setunambiguous automatonunambiguous monoid

Mathematics Subject Classification ID

Applications of graph theory (05C90) Formal languages and automata (68Q45) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• The boxes
• scientific article; zbMATH DE number 4023340
• scientific article; zbMATH DE number 4057515
• Minimal partitions of a box into boxes
• Independent collections of translates of boxes and a conjecture due to Grünbaum

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• Automorphism groups of designs
• Maximal chains and antichains
• The boxes

This page was built for publication: Generating boxes from ordered sets and graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803662)