Systems of representatives

[1]  On coset representatives in groups , 1958 .

[2]  R. Rado,et al.  Note on the Transfinite Case of Hall's Theorem on Representatives , 1967 .

[3]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[4]  P. J. Higgins.  Disjoint Transversals of Subsets , 1959, Canadian Journal of Mathematics.

[5]  Henryk Minc,et al.  Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices , 1963 .

[6]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[7]  O. Ore.  Theory of Graphs , 1962 .

[8]  Tibor Grünwald,et al.  Ein Neuer Beweis Eines Mengerschen Satzes , 1938 .

[9]  H. E. Vaughan,et al.  The Marriage Problem , 1950 .

[10]  O. Ore.  Graphs and matching theorems , 1955 .

[11]  Short proof of a theorem of Rado on graphs , 1964 .

[12]  R. P. Dilworth,et al.  A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS , 1950 .

[13]  L. Mirsky.  TRANSVERSALS OF SUBSETS , 1966 .

[14]  D. R. Fulkerson,et al.  Widths and heights of (0,1)-matrices. , 1961 .

[15]  L. Mirsky,et al.  Results and problems in the theory of doubly-stochastic matrices , 1963 .

[16]  R. Rado,et al.  A Theorem on General Measure Functions , 1938 .

[17]  S. Banach,et al.  Un théorème sur les transformations biunivoques , 1924 .

[18]  M. Marcus,et al.  Some results on doubly stochastic matrices , 1962 .

[19]  W. Vogel.  Bemerkungen zur Theorie der Matrizen aus Nullen und Einsen , 1963 .

[20]  C. J. Everett,et al.  Representations of Sequences of Sets , 1949 .

[21]  R. Rado,et al.  FACTORIZATION OF EVEN GRAPHS , 1949 .

[22]  A. Hoffman,et al.  The variation of the spectrum of a normal matrix , 1953 .

[23]  W. Vogel.  Lineare Programme und allgemeine Vertretersysteme , 1961 .

[24]  Hermann Weyl,et al.  Almost Periodic Invariant Vector Sets in a Metric Vector Space , 1949 .

[25]  Claude Berge,et al.  The theory of graphs and its applications , 1962 .

[26]  David Gale.  The basic theorems of real linear equations, inequalities, linear programming, and game theory , 1956 .

[27]  Marvin Marcus,et al.  DIAGONALS OF DOUBLY STOCHASTIC MATRICES , 1959 .

[28]  N. S. Mendelsohn,et al.  Some generalizations of the problem of distinct representatives , 1958 .

[29]  D. R. Fulkerson,et al.  Network Flow and Systems of Representatives , 1958, Canadian Journal of Mathematics.

[30]  R. Rado,et al.  Axiomatic Treatment of Rank in Infinite Sets , 1949, Canadian Journal of Mathematics.

[31]  D. R. Fulkerson,et al.  On the Max Flow Min Cut Theorem of Networks. , 1955 .

[32]  Hazel Perfect,et al.  Addendum: An extension of Banach's mapping theorem with applications to problems concerning common representatives , 1966, Mathematical Proceedings of the Cambridge Philosophical Society.

[33]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[34]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[35]  P. Hall.  On Representatives of Subsets , 1935 .

[36]  Koichiro Yamamoto,et al.  On the Asymptotic Number of Latin Rectangles , 1951 .

[37]  David Gale.  The theory of linear economic models , 1960 .

[38]  Emanuel Sperner.  Note zu der Arbeit von Herrn B. L. van der Waerden: “Ein Satz über Klasseneinteilungen von endlichen Mengen” , 1927 .

[39]  Paul Erdös,et al.  A colour problem for infinite graphs and a problem in the theory of relations , 1951 .

[40]  W. H. Gottschalk,et al.  Choice functions and Tychonoff’s theorem , 1951 .

[41]  T. Gallai,et al.  Maximum-Minimum Sätze über Graphen , 1958 .

[42]  H. Ryser.  A combinatorial theorem with an application to latin rectangles , 1951 .

[43]  Dénes König,et al.  Über mehrdeutige Abbildungen von Mengen , 1926 .

[44]  W. Maak.  Eine neue Definition der fastperiodischen Funktionen , 1935 .

[45]  Paul Erdös,et al.  The Asymptotic Number of Latin Rectangles , 1946 .

[46]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

[47]  K. Menger.  Zur allgemeinen Kurventheorie , 1927 .

[48]  D. R. Fulkerson.  THE MAXIMUM NUMBER OF DISJOINT PERMUTATIONS CONTAINED IN A MATRIX OF ZEROS AND ONES , 1964 .

[49]  Allgemeine Systeme von ReprÄsentanten , 1964 .

[50]  L. Mirsky,et al.  The Distribution of Positive Elements in Doubly‐Stochastic Matrices , 1965 .

[51]  Leon Henkin,et al.  Some interconnections between modern algebra and mathematical logic , 1953 .

[52]  R. Rado,et al.  Theorems on Linear Combinatorial Topology and General Measure , 1943 .

[53]  M. Hall.  Distinct representatives of subsets , 1948 .

[54]  D. Gale.  A theorem on flows in networks , 1957 .

[55]  J. Isbell.  Birkhoff’s problem 111 , 1955 .

[56]  A. J. Hoffman,et al.  11. Dilworth’s Theorem on Partially Ordered Sets , 1957 .

[57]  D. R. Fulkerson.  Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .

[58]  Henry B. Mann,et al.  Systems of Distinct Representatives , 1953 .

[59]  Kennan T. Smith,et al.  Linear Topological Spaces , 1966 .

[60]  H. Kuhn,et al.  Systems of Distinct Representations and Linear Programming , 1956 .

[61]  M. Hall.  An existence theorem for latin squares , 1945 .

[62]  D. Koenig.  Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[63]  Marshall Hall,et al.  An Algorithm for Distinct Representatives , 1956 .

[64]  E. S. Wolk.  A note on “The comparability graph of a tree” , 1965 .

[65]  Micha A. Perles.  A proof of dilworth’s decomposition theorem for partially ordered sets , 1963 .

[66]  R. Rado.  A THEOREM ON INDEPENDENCE RELATIONS , 1942 .

[67]  Micha A. Peles.  On dilworth’s theorem in the in finite case , 1963 .

[68]  A. Tucker,et al.  Linear Inequalities And Related Systems , 1956 .

[69]  D. König.  Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

[70]  H. J. Ryser,et al.  Matrices of zeros and ones , 1960 .

[71]  C. Berge.  Théorie des graphes et ses applications , 1958 .