Keyword

matroid theory

Description: A branch of combinatorics that studies matroids, mathematical structures abstracting notions of independence in settings such as graphs and linear algebra.

Primary topic: Advanced Combinatorial Mathematics (34%)

Wikidata ID: wiki/Q113853683

OpenAlex ID: keywords/matroids

Combinatorial Optimization: Algorithms and Complexity.

1984 · David S. Johnson, Christos H. Papadimitriou, et al. · American Mathematical Monthly · 5,942

Geometric Algorithms and Combinatorial Optimization

1988 · Martin Grötschel, László Lovász, et al. · Algorithms and combinatorics · 3,431

Combinatorial optimization: networks and matroids

2021 · Eugene L. Lawler · 3,320

Reducibility Among Combinatorial Problems

2009 · Richard M. Karp · Springer eBooks · 2,490

Handbook of Combinatorics

1995 · Ronald Graham, Martin Grötschel, et al. · Medical Entomology and Zoology · 1,525

Matroids and the greedy algorithm

1971 · Jack Edmonds · Mathematical Programming · 866

Submodular functions, matroids and certain polyhedra

2003 · Jack Edmonds · 732

Decomposition of regular matroids

1980 · P.D Seymour · Journal of Combinatorial Theory Series B · 730

PDF

Oriented Matroids

1993 · Bernd Sturmfels, Michel Las Vergnas, et al. · 719

Handbook of graph theory

2005 · Choice Reviews Online · 639

Signed graphs

1982 · Thomas Zaslavsky · Discrete Applied Mathematics · 555

PDF

On the Vector Representations of Induced Matroids

1973 · Bernt Lindström · Bulletin of the London Mathematical Society · 529

Submodular Functions, Matroids, and Certain Polyhedra

2003 · Jack Edmonds · Lecture notes in computer science · 513

Discrete Convex Analysis

2003 · Kazuo Murota · Society for Industrial and Applied Mathematics eBooks · 482

PDF

On the computational complexity of the Jones and Tutte polynomials

1990 · F. Jaeger, D. L. Vertigan, et al. · Mathematical Proceedings of the Cambridge Philosophical Society · 481

Classical deterministic complexity of Edmonds' Problem and quantum entanglement

2003 · Leonid Gurvits · ACM Symposium on Theory of Computing (STOC) · 453

Minimum partition of a matroid into independent subsets

1965 · Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 444

PDF

Matroid Theory

2011 · James Oxley · Oxford University Press eBooks · 440

Lectures on matroids

1965 · W.T. Tutte · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 433

PDF

An explication of secret sharing schemes

1992 · D. R. Stinson · Designs Codes and Cryptography · 396

Annotated Bibliographies in Combinatorial Optimization.

1998 · J. M. Wilson, M. Dell'Amico, et al. · Journal of the Operational Research Society · 394

The theory of convex geometries

1985 · PaulH. Edelman, RobertE. Jamison · Geometriae Dedicata · 387

The Tutte Polynomial and Its Applications

1992 · Thomas Brylawski, James Oxley · Cambridge University Press eBooks · 382

Systems of distinct representatives and linear algebra

1967 · Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 380

PDF

Surveys in Combinatorics

1979 · Cambridge University Press eBooks · 356

Works count: 4,581

Citation count: 69,640