Origins and basic concepts

[1]  Joseph P. S. Kung,et al.  A Classification of Modularly Complemented Geometric Lattices , 1986, Eur. J. Comb..

[2]  Paul H. Edelman,et al.  The theory of convex geometries , 1985 .

[3]  W. Pulleyblank.  Progress in combinatorial optimization , 1985 .

[4]  Henry Crapo,et al.  Selectors: A theory of formal languages, semimodular lattices, and branching and shelling processes☆ , 1984 .

[5]  J. Kung.  A characterization of orthogonal duality in matroid theory , 1983 .

[6]  László Lovász,et al.  Structural properties of greedoids , 1983, Comb..

[7]  R. Downey.  Nowhere simplicity in matroids , 1983, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[8]  Raul Cordovil,et al.  Sur la compatibilité des extensions ponctuelles d'un matroïde , 1983, J. Comb. Theory B.

[9]  Joseph P. S. Kung,et al.  A factorization theorem for comaps of geometric lattices , 1983, J. Comb. Theory B.

[10]  Carsten Thomassen,et al.  Duality of infinite graphs , 1982 .

[11]  Raul Cordovil,et al.  On reid’s 3-simplicial matroid theorem , 1982, Comb..

[12]  James Oxley,et al.  Matroids whose ground sets are domains of functions , 1982, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[13]  James G. Oxley,et al.  The Broken-circuit Complex: Its Structure and Factorizations , 1981, Eur. J. Comb..

[14]  Paul H. Edelman.  Meet-distributive lattices and the anti-exchange closure , 1980 .

[15]  Carsten Thomassen,et al.  Planarity and duality of finite and infinite graphs , 1980, J. Comb. Theory B.

[16]  Michel Las Vergnas,et al.  Convexity in oriented matroids , 1980, J. Comb. Theory B.

[17]  Raul Cordovil,et al.  Representation over a Field of Full Simplicial Matroids , 1980, Eur. J. Comb..

[18]  A. Nerode,et al.  Recursion Theory on Fields and Abstract Dependence , 1980 .

[19]  J. Remmel.  Recursion theory on algebraic structures with independent sets , 1980 .

[20]  J. Dawson.  A note on some algorithms for matroids , 1980 .

[21]  Klaus Truemper,et al.  On Whitney's 2-isomorphism theorem for graphs , 1980, J. Graph Theory.

[22]  P. Orlik,et al.  Combinatorics and topology of complements of hyperplanes , 1980 .

[23]  Ulrich Faigle,et al.  Geometries on partially ordered sets , 1980, J. Comb. Theory B.

[24]  D. Welsh,et al.  The computational complexity of matroid properties , 1980, Mathematical Proceedings of the Cambridge Philosophical Society.

[25]  Peter J. Cameron,et al.  ON PERMUTATION GEOMETRIES , 1979 .

[26]  U. Faigle.  Über Morphismen halbmodularer Verbände , 1979 .

[27]  Alexander Schrijver,et al.  Matroids and linking systems , 1979, J. Comb. Theory B.

[28]  Joseph P. S. Kung,et al.  Bimatroids and invariants , 1978 .

[29]  J. Kung.  The Alpha Function of a Matroid—I. Transversal Matroids , 1978 .

[30]  H. Q. Nguyen.  Semimodular functions and combinatorial geometries , 1978 .

[31]  Michel Las Vergnas,et al.  Orientability of matroids , 1978, J. Comb. Theory B.

[32]  Robert G. Bland,et al.  A combinatorial abstraction of linear programming , 1977, J. Comb. Theory B.

[33]  H. Wilf.  A note on P(-lambda; G) , 1977, J. Comb. Theory B.

[34]  P. J. Wilde,et al.  Matroids with given restrictions and contractions , 1977, J. Comb. Theory B.

[35]  Tom Brylawski,et al.  The broken-circuit complex , 1977 .

[36]  Paul Seymour,et al.  A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS , 1976 .

[37]  Michael J. Todd,et al.  Characterizing binary simplical matroids , 1976, Discret. Math..

[38]  F. Dunstan.  MATROIDS AND SUBMODULAR FUNCTIONS , 1976 .

[39]  A. R. Rao,et al.  Modular Pairs in Combinatorial Geometries , 1976 .

[40]  Michael J. Todd,et al.  A combinatorial generalization of polytopes , 1976 .

[41]  C. McDiarmid.  Rado's theorem for polymatroids , 1975, Mathematical Proceedings of the Cambridge Philosophical Society.

[42]  S. G. Hoggar.  Chromatic polynomials and broken cycles , 1975 .

[43]  Tom BRYLAWSKIi,et al.  Modular constructions for combinatorial geometries , 1975 .

[44]  C. J. H. McDiarmid,et al.  An exchange theorem for independence structures , 1975 .

[45]  Terrence J. Brown,et al.  Transversal Theory and F-Products , 1974, J. Comb. Theory A.

[46]  William M. Kantor,et al.  Dimension and Embedding Theorems for Geometric Lattices , 1974, J. Comb. Theory A.

[47]  Krzysztof Dworakowski,et al.  ON SOME PROPERTIES OF FLAT GRAPHS , 1974 .

[48]  C. McDiarmid.  A Note on a Theorem of R. Rado on Independent Transversals , 1973 .

[49]  Colin McDiarmid,et al.  Independence Structures and Submodular Functions , 1973 .

[50]  Sukhamay Kundu,et al.  A matroid generalization of a theorem of Mendelsohn and Dulmage , 1973, Discret. Math..

[51]  P. O'Neil,et al.  Shorter Notes: A Short Proof of Mac Lane's Planarity Theorem , 1973 .

[52]  H. Perfect.  Independent Transversals with Constraints , 1972 .

[53]  Colin McDiarmid,et al.  Strict Gammoids and Rank Functions , 1972 .

[54]  J. Edmonds.  Matroids and the greedy algorithm , 1971, Math. Program..

[55]  William H. Graves,et al.  A Categorical Approach to Combinatorial Geometry , 1971, J. Comb. Theory A.

[56]  W. Graves.  An algebra associated to a combinatorial geometry , 1971 .

[57]  R. Brualdi.  Menger's Theorem and Matroids , 1971 .

[58]  R. Brualdi.  On Families of Finite Independence Structures , 1971 .

[59]  D. Welsh.  Generalized versions of Hall's theorem , 1971 .

[60]  T. D. Parsons,et al.  On Planar Graphs , 1971 .

[61]  David Sachs.  Geometric Mappings on Geometric Lattices , 1971, Canadian Journal of Mathematics.

[62]  G. Rota,et al.  On The Foundations of Combinatorial Theory: Combinatorial Geometries , 1970 .

[63]  H. Perfect,et al.  Submodular functions and independence structures , 1970 .

[64]  Dominic Welsh,et al.  On Matroid Theorems of Edmonds and Rado , 1970 .

[65]  Hazel Perfect,et al.  A generalization of Rado's theorem on independent transversals , 1969, Mathematical Proceedings of the Cambridge Philosophical Society.

[66]  Victor Klee,et al.  THE GREEDY ALGORITHM FOR FINITARY AND COFINITARY MATROIDS , 1969 .

[67]  Dominic Welsh,et al.  Some applications of a theorem of Rado , 1968 .

[68]  R. Brualdi,et al.  Exchange systems, matchings, and transversals , 1968 .

[69]  D. Gale.  Optimal assignments in an ordered set: An application of matroid theory , 1968 .

[70]  D. Welsh.  Kruskal's theorem for matroids , 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

[71]  H. Crapo.  A higher invariant for matroids , 1967 .

[72]  W. T. Tutte.  Connectivity in graphs , 1966 .

[73]  R. C. Bose,et al.  Linear representations of projective planes in projective spaces , 1966 .

[74]  S. Lefschetz.  PLANAR GRAPHS AND RELATED TOPICS. , 1965, Proceedings of the National Academy of Sciences of the United States of America.

[75]  Lino Gutiérrez Novoa,et al.  On $n$-ordered sets and order completeness. , 1965 .

[76]  George B. Dantzig,et al.  Linear programming and extensions , 1965 .

[77]  D. R. Fulkerson,et al.  Flows in Networks , 1963 .

[78]  J. Riordan.  Introduction to Combinatorial Analysis , 1958 .

[79]  Daniel T. Finkbeiner,et al.  A GENERAL DEPENDENCE RELATION FOR LATTICES , 1951 .

[80]  R. P. Dilworth.  The Structure of Relatively Complemented Lattices , 1950 .

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

[82]  R. P. Dilworth.  Dependence Relations in a Semi-Modular Lattice , 1944 .

[83]  R. Baer.  A unified theory of projective spaces and finite abelian groups , 1942 .

[84]  Hofreiter.  Moderne Algebra , 1941 .

[85]  R. P. Dilworth.  Lattices with Unique Irreducible Decompositions , 1940 .

[86]  L. Wilcox.  Modularity in the Theory of Lattices , 1939 .

[87]  F. Klein-Barmen.  Birkhoffsche und harmonische Verbände , 1937 .

[88]  C. Torrance.  Tangent lines and planes in topological spaces , 1937 .

[89]  H. Hornich.  Grundlagen der Elementargeometrie , 1936 .

[90]  R. Baer.  The Subgroup of the Elements of Finite Order of an Abelian Group , 1936 .

[91]  Karl Menger,et al.  New Foundations of Projective and Affine Geometry , 1936 .

[92]  Garrett Birkhoff,et al.  Abstract Linear Dependence and Lattices , 1935 .

[93]  Garrett Birkhoff,et al.  Combinatorial Relations in Projective Geometries , 1935 .

[94]  H. Whitney.  On the Abstract Properties of Linear Dependence , 1935 .

[95]  Oystein Ore,et al.  On the Foundation of Abstract Algebra. II , 1935 .

[96]  G. Birkhoff,et al.  On the combination of subalgebras , 1933, Mathematical Proceedings of the Cambridge Philosophical Society.

[97]  Hassler Whitney,et al.  The Coloring of Graphs , 1932 .

[98]  H. Whitney.  A logical expansion in mathematics , 1932 .

[99]  A. Nerode,et al.  Recursion Theory on Matroids II , 1983 .

[100]  J. Baldwin.  Recursion Theory and Abstract Dependence , 1982 .

[101]  Terry A. McKee,et al.  A quantifier for matroid duality , 1981, Discret. Math..

[102]  D. Hausmann,et al.  Algorithmic versus axiomatic definitions of matroids , 1981 .

[103]  Ulrich Faigle,et al.  Projective geometry on partially ordered sets , 1981 .

[104]  G. Nicoletti.  Generating cryptomorphic axiomatizations of matroids , 1980 .

[105]  Maurice Tchuente,et al.  Independence systems with continuous cardinality of bases , 1980, Discret. Math..

[106]  Michel Las Vergnas,et al.  On the Tutte Polynomial of a Morphism of Matroids , 1980 .

[107]  P. McMullen.  Transforms, Diagrams and Representations , 1979 .

[108]  Raul Cordovil,et al.  Geometries simpliciales unimodulaires , 1979, Discret. Math..

[109]  Bernt Lindström,et al.  Non-regular simplicial matroids , 1979, Discret. Math..

[110]  Ulrich Faigle,et al.  The greedy algorithm for partially ordered sets , 1979, Discret. Math..

[111]  W. T. Tutte,et al.  Graph theory and related topics , 1979 .

[112]  J. Spencer,et al.  Strong independence of graph copy functions , 1978 .

[113]  Ervin Györi,et al.  A theorem of the transversal theory for matroids of finite character , 1978, Discret. Math..

[114]  Douglas G. Kelly,et al.  The Higgs factorization of a geometric strong map , 1978, Discret. Math..

[115]  J. H. Mason,et al.  Matroids as the Study of Geometrical Configurations , 1977 .

[116]  Joseph P. S. Kung,et al.  The core extraction axiom for combinatorial geometries , 1977, Discret. Math..

[117]  Michel Las Vergnas,et al.  Acyclic and totally cyclic orientations of combinatorial geometries , 1977, Discret. Math..

[118]  Hien Quang Nguyen,et al.  Functions of the category of combinatorial geometries and strong maps , 1977, Discret. Math..

[119]  Saunders Mac Lane,et al.  Topology and logic as a source of algebra , 1976 .

[120]  Daniel Kennedy,et al.  Majors of geometric strong maps , 1975, Discret. Math..

[121]  Bradley Hull,et al.  Two algorithms for matroids , 1975, Discret. Math..

[122]  C. McDiarmid,et al.  EXTENSIONS OF MENGER'S THEOREM , 1975 .

[123]  T. Dowling,et al.  Elementary strong maps and transversal geometries , 1974, Discret. Math..

[124]  R. P. Dilworth,et al.  Algebraic theory of lattices , 1973 .

[125]  David Sachs,et al.  A note on geometric mappings , 1972 .

[126]  R. Webster,et al.  Convexity spaces. I. The basic properties , 1972 .

[127]  M. L. Vergnas,et al.  Sur la Dualite en Theorie des Matroides , 1971 .

[128]  R. Brualdi.  Generalized transversal theory , 1971 .

[129]  Fumitomo Maeda,et al.  Theory of symmetric lattices , 1970 .

[130]  T. A. Dowling,et al.  MATCHING THEORY FOR COMBINATORIAL GEOMETRIES , 1970 .

[131]  D. Higgs,et al.  Matroids and duality , 1969 .

[132]  Hazel Perfect,et al.  Independence Spaces and Combinatorial Problems , 1969 .

[133]  H. Crapo,et al.  Möbius inversion in lattices , 1969 .

[134]  Dominic Welsh.  Transversal Theory and Matroids , 1969, Canadian Journal of Mathematics.

[135]  G. A. Dirac,et al.  CONNECTIVITY IN GRAPHS (Mathematical Expositions No.15) , 1968 .

[136]  H. Crapo,et al.  Structure theory for geometric lattices , 1967 .

[137]  D. Higgs,et al.  Maps of Geometries , 1966 .

[138]  S. Maeda.  On the symmetry of the modular relation in atomic lattices , 1965 .

[139]  W. T. Tutte.  Lectures on matroids , 1965 .

[140]  H. Crapo.  Single-element extensions of matroids , 1965 .

[141]  G. A. Dirac,et al.  Extensions of Menger's Theorem , 1963 .

[142]  W. T. Tutte.  How to Draw a Graph , 1963 .

[143]  D. Finkbeiner.  A Semimodular Imbedding of Lattices , 1960, Canadian Journal of Mathematics.

[144]  A. Ingleton.  A Note on Independence Functions and Rank , 1959 .

[145]  R. Rado.  Note on Independence Functions , 1957 .

[146]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[147]  Waclaw Sierpinski,et al.  General Topology: (Mathematical Expositions No. 7) , 1952 .

[148]  Hsu Chen-Jung.  On Lattice Theoretic Characterization of the Parallelism in Affine Geometry , 1949 .

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

[150]  Saunders Mac Lane,et al.  A combinatorial condition for planar graphs , 1937 .

[151]  Saunders MacLane,et al.  Some Interpretations of Abstract Linear Dependence in Terms of Projective Geometry , 1936 .

[152]  H. Whitney.  2-Isomorphic Graphs , 1933 .

[153]  H. Whitney.  A Set of Topological Invariants for Graphs , 1933 .

[154]  Hassler Whitney,et al.  On the Classification of Graphs , 1933 .

[155]  C. Kuratowski.  Sur le problème des courbes gauches en Topologie , 1930 .

[156]  G. Birkhoff.  A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[157]  E. Steinitz.  Algebraische Theorie der Körper. , 1910 .