Abstract
A theorem of Sands, Sauer, and Woodrow, extending the Gale-Shapley theorem, states that if G is a digraph whose arc set is the union of the arc sets of two posets, then G has a kernel. We prove a weighted version of this theorem.
| Original language | English |
|---|---|
| Pages (from-to) | 35-43 |
| Number of pages | 9 |
| Journal | Order |
| Volume | 31 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 2014 |
Keywords
- Digraph
- Kernel
- Partial order
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'Kernels in Weighted Digraphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver