A combinatorial problem involving graphs and matrices

DOI10.1016/0012-365X(82)90043-7zbMath0495.05001OpenAlexW2055742083MaRDI QIDQ1169462

William T. jun. Trotter, Ted R. Monroe

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)90043-7

zbMATH Keywords

1-factorssystem of distinct representativesdimension theory of partially ordered sets

Mathematics Subject Classification ID

Partial orders, general (06A06) Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Forcing posets with large dimension to contain large standard examples ⋮ Removing critical pairs ⋮ Dimension and matchings in comparability and incomparability graphs. ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• A generalization of Hiraguchi's: Inequality for posets
• Maximal dimensional partially ordered sets. III: A characterization of Hiraguchi's inequality for interval dimension
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Maximal dimensional partially ordered sets. II: Characterization of 2n- element posets with dimension n
• Inequalities in Dimension Theory for Posets
• On Representatives of Subsets

This page was built for publication: A combinatorial problem involving graphs and matrices