Some sequences associated with combinatorial structures

DOI10.1016/0012-365X(86)90077-4zbMath0588.05004MaRDI QIDQ1073032

Michael E. Saks

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

partitionfinite posetduality theoremsurvey articleDilworth's theoreminteger sequences associated with hypergraphs

Mathematics Subject Classification ID

Partial orders, general (06A06) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Hypergraphs (05C65) Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (9)

Bound on the Jordan type of a generic nilpotent matrix commuting with a given matrix ⋮ Wide partitions, Latin tableaux, and Rota's basis conjecture ⋮ The symbiotic relationship of combinatorics and matrix theory ⋮ Nilpotent matrices having a given Jordan type as maximum commuting nilpotent orbit ⋮ On Greene-Kleitman's theorem for general digraphs ⋮ Finite posets and Ferrers shapes ⋮ Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers ⋮ Hereditary properties of matrices with cut-points ⋮ Brauer diagrams, updown tableaux and nilpotent matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs and matching theorems
• Path partitions and packs of acyclic digraphs
• ``Poly-unsaturated posets: The Greene-Kleitman theorem is best possible
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• A short proof of the existence of k-saturated partitions of partially ordered sets
• Critical graphs for chromatic difference sequences
• On chain and antichain families of a partially ordered set
• Product partial orders with the Sperner property
• Extending the Greene-Kleitman theorem to directed graphs
• k-optimal partitions of a directed graph
• Some partitions associated with a partially ordered set
• On partitions of a partially ordered set
• The chromatic difference sequence of a graph
• Extending Greene's theorem to directed graphs
• Transversal theory. An account of some aspects of combinatorial mathematics
• Investigations on an edge coloring problem
• Anti-blocking polyhedra
• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• A decomposition theorem for partially ordered sets
• Systems of Distinct Representations and Linear Programming
• On the Foundations of Combinatorial Theory: IX Combinatorial Methods in Invariant Theory
• Acyclic Digraphs, Young Tableaux and Nilpotent Matrices
• Dilworth Numbers, Incidence Maps and Product Partial Orders
• Semiantichains and Unichain Coverings in Direct Products of Partial Orders
• A Minimax Equality Related to the Longest Directed Path in an Acyclic Graph
• The Normal Form of Compound and Induced Matrices
• On Representatives of Subsets
• Maximum matching and a polyhedron with 0,1-vertices
• Systems of distinct representatives and linear algebra
• A Characterization of Comparability Graphs and of Interval Graphs
• Galois Connexions
• The structure of Sperner k-families

This page was built for publication: Some sequences associated with combinatorial structures