Dimension and matchings in comparability and incomparability graphs.

DOI10.1007/s11083-015-9355-yzbMath1344.06003OpenAlexW2101926927MaRDI QIDQ5965146

William T. jun. Trotter, Rui Dong Wang

Publication date: 2 March 2016

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-015-9355-y

zbMATH Keywords

matchingscomparability graphsdimension of finite posets

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Forcing posets with large dimension to contain large standard examples

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Removing critical pairs
• On the size of maximal chains and the number of pairwise disjoint maximal antichains
• On the size of maximal antichains and the number of pairwise disjoint maximal chains
• A combinatorial problem involving graphs and matrices
• Irreducible posets with large height exist
• A generalization of Hiraguchi's: Inequality for posets
• Some partitions associated with a partially ordered set
• Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
• On the complexity of posets
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• The dimension of posets with planar cover graphs.
• Tree-width and dimension
• Dimension and height for posets with planar cover graphs.
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
• A proof of Dilworth's decomposition theorem for partially ordered sets
• A decomposition theorem for partially ordered sets
• Inequalities in Dimension Theory for Posets
• A forbidden subposet characterization of an order — dimension inequality
• The 3-Irreducible Partially Ordered Sets
• A Dual of Dilworth's Decomposition Theorem
• Partially Ordered Sets
• The structure of Sperner k-families

This page was built for publication: Dimension and matchings in comparability and incomparability graphs.