Decomposing weighted digraphs into sums of chains

DOI10.1016/0166-218X(87)90060-6zbMath0606.05028OpenAlexW1966172902MaRDI QIDQ1084404

Peter C. Fishburn

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0166-218x(87)90060-6

zbMATH Keywords

chainsrankingstransitive tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Social choice (91B14)

Related Items

Binary choice probabilities and rankings, General transitivity conditions for fuzzy reciprocal preference matrices., Half-integrality of vertices of the generalized transitive tournament polytope \((n=6)\), Induced binary probabilities and the linear ordering polytope: A status report, A historical and contemporary perspective on random scale representations of choice probabilities and reaction times in the context of Cohen and Falmagne's (1990, Journal of Mathematical Psychology, 34) results, On characterizing the extreme points of the generalized transitive tournament polytope, Obituary: Peter C. Fishburn (1936--2021), Outranking Relations: Do They Have Special Properties?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A decomposition theorem for partially ordered sets
• The Complexity of the Partial Order Dimension Problem
• Inequalities in Dimension Theory for Posets
• Decomposing partial orderings into chains
• Partially Ordered Sets