\space
| Matroids | Books | Surveys | Bibliography | Software | People |
BIBLIOGRAPHY
A - D E - H I - L M N O P Q - T U - Z

    M
  1. MacLane, S. (1936). Some interpretations of abstract linear dependence in terms of projective geometry. Amer. J. Math. 58, 236-240.
  2. MacLane, S. (1937). A combinatorial condition for planar graphs. Fundamenta Math. 28, 22-32.
  3. MacLane, S. (1938). A lattice formulation for transcendence degrees and p-bases. Duke Math. J. 4, 455-468.
  4. Mader, W. (1979). Connectivity and edge-connectivity in finite graphs. In Surveys in combinatorics (ed. Bollobás, B.), London Math. Soc. Lecture Notes 38, pp. 66-95. Cambridge University Press, Cambridge.
  5. Maeda, F. (1964). Perspectivity of points in matroid lattices. J. Sci. Hiroshima Univ. Ser. A-1 Math. 28, 101-112.
  6. Maeda, F. and Maeda S. (1970). Theory of symmetric lattices. Die Grundlehren der mathematischen Wissenschaften, Band 173. Springer-Verlag, New York-Berlin.
  7. Magnanti, T. L. (1974). Complementary bases of a matroid. Discrete Math. 8, 355-361.
  8. Mahoney, C. (1985). On the unimodality of the independent set numbers of a class of matroids. J. Combin. Theory Ser. B 39, 77-85.
  9. Mason, J. H. (1971). Geometrical realization of combinatorial geometries. Proc. Amer. Math. Soc. 30, 15-21.
  10. Mason, J. H. (1971). A characterization of transversal independence spaces. In Théorie des matroïdes (Rencontre Franco-Britannique, Brest, 1970), Lecture Notes in Math., Vol. 211, pp. 86-94. Springer, Berlin.
  11. Mason, J. H. (1972). Matroids: unimodal conjectures and Motzkin's theorem. In Combinatorics (eds. Welsh, D. J. A. and Woodall, D. R.), pp. 207-220. Institute of Math. and its Applications, Southend-on-Sea.
  12. Mason, J. H. (1972). On a class of matroids arising from paths in graphs. Proc. London Math. Soc. (3) 25, 55-74.
  13. Mason, J. H. (1973). Maximal families of pairwise disjoint maximal proper chains in a geometric lattice. J. London Math. Soc. (2) 6, 539-542.
  14. Mason, J. H. (1977). Matroids as the study of geometrical configurations. In Higher combinatorics (ed. Aigner, M.), pp. 133-176. Reidel, Dordrecht.
  15. Mason, J. H. and Oxley, J. G. (1980). A circuit covering result for matroids. Math. Proc. Camb. Phil. Soc. 87, 25-27.
  16. Matthews, L. R. (1977). Bicircular matroids. Quart. J. Math. Oxford Ser. (2) 28, 213-228.
  17. Maurer, S. B. (1973). Matroid basis graphs. II. J. Combin. Theory Ser. B 15, 121-145.
  18. Maurer, S. B. (1973). Basis graphs of pregeometries. Bull. Amer. Math. Soc. 79, 783-786.
  19. Maurer, S. B. (1973). Matroid basis graphs. I. J. Combin. Theory Ser. B 14, 216-240.
  20. Maurer, S. B. (1975). A maximum-rank minimum-term-rank theorem for matroids. Linear Algebra and Appl. 10, 129-137.
  21. Mayeda, W. (1970). A proof of Tutte's realizability condition. IEEE Trans. Circuit Theory CT-17, 506-511.
  22. Mayeda, W. (1971). Simplified proof of Tutte's theorem on cut set and circuit matrices. Electron. Commun. Japan, no. 7 54, 23-28.
  23. McDiarmid, C. (1972). Strict gammoids and rank functions. Bull. London Math. Soc. 4, 196-198.
  24. McDiarmid, C. J. H. (1973). Independence structures and submodular functions. Bull. London Math. Soc. 5, 18-20.
  25. McDiarmid, C. J. H. (1973). A note on a theorem of R. Rado on independent transversals. Bull. London Math. Soc. 5, 315-316.
  26. McDiarmid, C. J. H. (1975). Rado's theorem for polymatroids. Math. Proc. Cambridge Philos. Soc. 78, no. 2, 263-281.
  27. McDiarmid, C. J. H. (1975). Extensions of Menger's theorem. Quart. J. Math. Oxford Ser. (2) 26, 141-157.
  28. McDiarmid, C. J. H. (1975). An exchange theorem for independence structures. Proc. Amer. Math. Soc. 47, 513-514.
  29. McDiarmid, C. J. H. (1976). On the number of systems of distinct representations in an independence structure. J. Math. Anal. Appl. 53, no. 1, 133-136.
  30. McNulty, J. (1993). Ports and Oriented Matroids. Congresses Numerantium 96 (1993), 11-20. 96, 11-20.
  31. McNulty, J. (1994). Generalized Affine Matroids. Congresses Numerantium 101, 243-254.
  32. Mendelsohn, N. S. and Dulmage, A. L. (1958). Some generalizations of the problem of distinct representatives. Canad. J. Math. 10, 230-242.
  33. Menger, K (1927). Zur allgemeinen Kurventheorie. Fund. Math. 10, 96-115.
  34. Milner, E. C. (1975). Independent transversals for countable set systems. J. Combin. Theory Ser. A 19, no. 2, 125-133.
  35. Minty, G. J. (1966). On the axiomatic foundations of the theories of directed linear graphs, electrical networks and network programming. J. Math. Mech. 15, 485-520.
  36. Mirsky, L. (1969). Transversal theory and the study of abstract independence. J. Math. Anal. Appl. 25, 209-217.
  37. Mirsky, L. (1971). Transversal theory. Academic Press, London.
  38. Mirsky, L. (1973). The rank formula of Nash-Williams as a source of covering and packing theorems. J. Math. Anal. Appl. 43, 328-347.
  39. Motzkin, T. (1951). The lines and planes connecting the points of a finite set. Trans. Amer. Math. Soc. 70, 451-464.
  40. Mullen, G. and Whittle, G. (1992). Point sets with uniformity properties and orthoganal hypercubes. Monatshefte fur Mathematik 113, 265-273.
  41. Murty, U. S. R. (1969). Sylvester matroids. In Recent progress in combinatorics (ed. Tutte, W. T.), pp. 283-286. Academic press, New York.
  42. Murty, U. S. R. (1970). Matroids with Sylvester property. Aequationes Math. 4, 44-50.
  43. Murty, U. S. R. (1971). Equicardinal matroids. J. Combin. Theory Ser. B 11, 120-126.
  44. Murty, U. S. R. (1974). Extremal critically connected matroids. Discrete Math. 8, 49-58.
  45. Murty, U. S. R. (1976). Extremal matroids with forbidden restrictions and minors. Congressus Numerantium. 17, 463-468.

    46. N
  46. Nakasawa, T. (1935). Zur Axiomatik der linearen Abhängigkeit, I. Sci. Rep. Tokyo Bunrika Daigaku 2, 235-255.
  47. Nakasawa, T. (1936). Zur Axiomatik der linearen Abhängigkeit, II. Sci. Rep. Tokyo Bunrika Daigaku 3, 123-136.
  48. Nakasawa, T. (1936). Zur Axiomatik der linearen Abhängigkeit, III. Sci. Rep. Tokyo Bunrika Daigaku 3, 45-69.
  49. Nash-Williams, C. St. J. A. (1961). Edge-disjoint spanning trees of finite graphs. J. London Math. Soc. 36, 445-450.
  50. Nash-Williams, C. St. J. A. (1966). An application of matroids to graph theory. In Theory of graphs (Internat. Sympos., Rome) pp. 263-265. Dunod, Paris.
  51. Negami, S. (1982). A characterization of 3-connected graphs containing a given graph. J. Combin. Theory Ser. B 32, 69-74.
  52. Nesetril, J., Poljak, S., and Turzík, D. (1981). Amalgamations of matroids and its applications. J. Combin. Theory Ser. B 31, 9-22.
  53. Nesetril, J., Poljak, S., and Turzík, D. (1985). Special amalgams and Ramsey matroids. In Matroid theory (eds. Lovasz, L. and Recski, A.), Colloq. Math. Soc. Janos Bolyai 40, pp. 267-298. North-Holland, Amsterdam.

    54. O
  54. Ore, O. (1955). Graphs and matching theorems. Duke Math. J. 22, 625-639.
  55. Ore, O. (1967). The four-color problem. Academic Press, New York.
  56. Ostanello-Borreani, A. (1968). Osservazioni sulle matroid trasversali. (English summary) Boll. Un. Mat. Ital. (4) 1, 397-402.
  57. Oxley, J. G. (1978). Colouring, packing and the critical problem. Quart. J. Math. Oxford Ser. (2) 29, 11-22.
  58. Oxley, J. G. (1978). Cocircuit coverings and packings for binary matroids. Math. Proc. Camb. Phil. Soc. 83, 347-351.
  59. Oxley, J. G. (1979). On cographic regular matroids. Discrete Math. 25, 89-90.
  60. Oxley, J. G. (1981). On connectivity in matroids and graphs. Trans. Amer. Math. Soc. 265, 47-58.
  61. Oxley, J. G. (1981). On matroid connectivity. Quart. J. Math. Oxford Ser. (2) 32, 193-208.
  62. Oxley, J. G. (1981). On 3-connected matroids. Canad. J. Math. 33, 20-27.
  63. Oxley, J. G. (1981). On a matroid generalization of graph connectivity. Math. Proc. Camb. Phil. Soc. 90, 207-214.
  64. Oxley, J. G. (1983). On the numbers of bases and circuits in simple binary matroids. European J. Combin. 4, 169-178.
  65. Oxley, J. G. (1984). On singleton 1-rounded sets of matroids. J. Combin. Theory Ser. B 37, 189-197.
  66. Oxley, J. G. (1984). On minor-minimally-connected matroids. Discrete Math. 51, 63-72.
  67. Oxley, J. G. (1984). On the intersections of circuits and cocircuits in matroids. Combinatorica 4, 187-195.
  68. Oxley, J. G. (1986). On the matroids representable over GF(4). J. Combin. Theory Ser. B 41, 250-252.
  69. Oxley, J. G. (1986). On ternary transversal matroids. Discrete Math. 62, 71-83.
  70. Oxley, J. G. (1987). A characterization of the ternary matroids with no M(K4)-minor. J. Combin. Theory Ser. B 42, 212-249.
  71. Oxley, J. G. (1987). The binary matroids with no 4-wheel minor. Trans. Amer. Math. Soc. 301, 63-75.
  72. Oxley, J. G. (1987). On nonbinary 3-connnected matroids. Trans. Amer. Math. Soc. 300, 663-679.
  73. Oxley, J. G. (1988). On circuit exchange properties for matroids. European J. Combin. 9, 331-336.
  74. Oxley, J. G. (1989). The regular matroids with no 5-wheel minor. J. Combin. Theory Ser. B 46, 292-305.
  75. Oxley, J. G. (1989). A characterization of certain excluded-minor classes of matroids. European J. Combin. 10, 275-305.
  76. Oxley, J. G. (1990). On an excluded-minor class of matroids. Discrete Math. 82, 35-52.
  77. Oxley, J. G. (1990). A characterization of a class of nonbinary matroids. J. Combin. Theory Ser. B 49, 181-189.
  78. Oxley, J. G. (1991). Ternary paving matroids. Discrete Math. 91, 77-86.
  79. Oxley, J. G. (1992). Infinite matroids. In Matroid applications (ed. White, N.), pp. 73-90. Cambridge University Press, Cambridge.
  80. Oxley, J. G. (1992). Matroid theory. Oxford University Press, New York.
  81. Oxley, J. G. and Reid, T. J. (1990). The smallest rounded sets of binary matroids. European. J. Combin. 11, 47-56.
  82. Oxley, J. G. and Row, D. (1989). On fixing elements in matroid minors. Combinatorica 9, 69-74.
  83. Oxley, J. G. and Whittle, G. (1991). A note on the non-spanning circuits of a matroid. European J. Combin. 12, 259-261.
  84. Oxley, J. G. and Whittle, G. (1992). Connectivity of submodular functions. Discrete Math. 105, 173-184.
  85. Oxley, J. G. and Whittle, G. (1993). A characterization of Tutte invariants of 2-polymatroids. J. Combin. Theory Ser. B 59, 210-244.
  86. Oxley, J. G. and Whittle, G. (1993). Some excluded-minor theorems for a class of polymatroids. Combinatorica. 13, 467-476.
  87. Oxley, J. G. and Whittle, G. (1993). Tutte invariants for 2-polymatroids. In Graph structure theory (eds. Robertson, N. and Seymour, P.) Contempory Mathematics 147, pp. 9-19. American Mathematical Society, Providence, RI.
  88. Oxley, J. G. and Whittle, G. (1993). On sign-representable matroids. Math. Proc. Camb. Phil. Soc. 113, 499-506.
  89. Oxley, J. G. and Whittle, G. (submitted). On weak maps of ternary matroids.
  90. Oxley, J. G., Vertigan, D., and Whittle, G. (submitted). On extremal near-regular and sqrt[6]{1}-matroids.
  91. Oxley, J. G., Prendergast, K., and Row, D. (1982). Matroids whose ground sets are domains of functions. J. Austral. Math. Soc. Ser. A 32, 380-387.
  92. Oxley, J. G., Vertigan, D., and Whittle, J. G. (to appear). On inequivalent representations of matroids over finite fields. J. Combin. Theory Ser. B.

    93. P
  93. Parsons, T. D. (1971). On planar graphs. Amer. Math. Monthly 78, 176-178.
  94. Patkar, S., Servatius, B., and Subrahmanyam, K. V. 1994). Abstract and generic rigidity in the plane. J. Combin. Theory Ser. B 62 (1), 107-116.
  95. Perfect, H. (1968). Applications of Menger's graph theorem. J. Math. Anal. Appl. 22, 96-111.
  96. Perfect, H. (1969). Independence spaces and combinatorial problems. Proc. London Math. Soc. (3) 19, 17-30.
  97. Perfect, H. (1969). A generalization of Rado's theorem on independent transversals. Proc. Camb. Phil. Soc. 66, 513-515.
  98. Perfect, H. (1972). Independent transversals with constraints. J. London Math. Soc. (2) 5, 385-386.
  99. Perfect, H. and Pym, J. S. (1970). Submodular functions and independence structures. J. Math. Anal. Appl. 30, 1-31.
  100. Piff, M. J. (1969). The representability of matroids. Dissertation for Diploma in Advanced Math., University of Oxford.
  101. Piff, M. J. (1971). Properties of finite character of independence spaces. Mathematika 18, 201-208.
  102. Piff, M. J. (1972). Some problems in combinatorial theory. D. Phil. thesis, University of Oxford.
  103. Piff, M. J. (1973). An upper bound for the number of matroids. J. Combin. Theory Ser. B 14, 241-245.
  104. Piff, M. J. and Welsh D. J. A. (1970). On the vector representation of matroids. J. London Math. Soc. (2) 2, 284-288.
  105. Piff, M. J. and Welsh, D. J. A. (1971). The number of combinatorial geometries. Bull. London Math. Soc. 3, 55-56.
  106. Plummer, M. D. (1968). On minimal blocks. Trans. Amer. Math. Soc. 134, 85-94.
  107. Poljak, S. and Turzík, D. (1982). A note on sticky matroids. Discrete Math. 42, 119-123.
  108. Poljak, S. and Turzík, D. (1984). Amalgamation over uniform matroids. Czech. Math. J. 34, 239-246.
  109. Purdy, G. (1986). Two results about points, lines and planes. Discrete Math. 60, 215-218.
  110. Pym, J. S. (1969). A proof of the linkage theorem. J. Math. Anal. Appl. 27, 636-638.
    111. A - D E - H I - L M N O P Q - T U - Z
    | Matroids | Books | Surveys | Bibliography | Software | People |