Revision history of "Popular matchings in non-bipartite graphs"

Jump to: navigation, search

Diff selection: Mark the radio boxes of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

  • (cur | prev) 17:52, 24 September 2015Cseh (Talk | contribs). . (2,051 bytes) (+2,051). . (Created page with "(suggested by Ágnes Cseh) = Problem Statement = Let <math>G</math> be a not necessarily bipartite graph. Each vertex has a strict preference list ranking its neighbors in...")