On the Ferrers dimension of a digraph

DOI10.1016/0012-365X(82)90167-4MaRDI QIDQ1158180zbMATH OpenFDO

Authors Olivier Cogis

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365X(82)90167-4

zbMATH Keywords

Ferrer's digraphsFerrer's dimensionnumber of linear ordersorder dimension of posets

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20) Partial orders, general (06A06)

Cites work

• Ferrers digraphs and threshold graphs
• scientific article; zbMATH DE number 3648772 (Why is no real title available?)
• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 3654150 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3564982 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• scientific article; zbMATH DE number 3064989 (Why is no real title available?)
• On a Digraph Dimension
• Partially Ordered Sets

Cited in

(33)

• Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• On realizable biorders and the biorder dimension of a relation
• Collapsing binary data for algebraic multidimensional representation
• On the separation of two relations by a biorder or a semiorder
• On finding the bidimension of a relation
• An interval digraph in relation to its associated bipartite graph
• Interval dimension and MacNeille completion
• Dimension of valued relations
• Sublinear approximation algorithms for boxicity and related problems
• Interval orders based on arbitrary ordered sets
• On the structure of trapezoid graphs
• A recognition algorithm for simple-triangle graphs
• Finite dimensional scattered posets
• Threshold Dimension of Graphs
• Injective envelopes of transition systems and Ferrers languages
• Ferrers dimension of grid intersection graphs
• Permutation bigraphs and interval containments
• On covering numbers, Young diagrams, and the local dimension of posets
• Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs
• Chain representations of nested families of biorders
• The Number of Plane Diagrams of a Lattice
• Convex geometry and group choice
• On incomplete preference structures
• Dimensions of knowledge structures
• Ferrers dimension and boxicity
• Grid intersection graphs and order dimension
• Matching relations and the dimensional structure of social choices
• Interval dimension is a comparability invariant
• Bi-semiorders with frontiers on finite sets
• Forbidden substructure for interval digraphs/bigraphs
• Plural psychological developmental models: An ordinal generalization of the Guttman scale
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers

This page was built for publication: On the Ferrers dimension of a digraph

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