Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
matroid circuits
Description:
Minimal dependent subsets of a matroid’s ground set, studied in matroid structure, enumeration, and algorithms.
Primary topic:
Advanced Graph Theory Research (46%)
Related topics:
Advanced Graph Theory Research (46%),
Advanced Combinatorial Mathematics (21%),
Complexity and Algorithms in Graphs (18%)
OpenAlex ID:
keywords/matroid-circuits
Matroids and Graphs
1959
·
W. T. Tutte
·
Transactions of the American Mathematical Society
·
238
PDF
Biased graphs. II. The three matroids
1991
·
Thomas Zaslavsky
·
Journal of Combinatorial Theory Series B
·
167
On the Complexity of Some Enumeration Problems for Matroids
2005
·
L. Khachiyan
, E. Boros
, et al.
·
SIAM Journal on Discrete Mathematics
·
88
On Circuit Valuation of Matroids
2001
·
Kazuo Murota
, Akihisa Tamura
·
Advances in Applied Mathematics
·
46
On functions of strengtht
1983
·
M. Deza
, P. Frankl
, et al.
·
COMBINATORICA
·
40
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
2021
·
Rohit Gurjar
, Thomas Thierauf
, et al.
·
SIAM Journal on Computing
·
34
PDF
Efficient enumeration of solutions produced by closure operations
2019
·
Arnaud Mary
, Yann Strozecki
·
Discrete Mathematics & Theoretical Computer Science
·
34
PDF
On matroids on edge sets of graphs with connected subgraphs as circuits II
1975
·
J.M.S. Simões-Pereira
·
Discrete Mathematics
·
34
The Erdös–Pósa property for matroid circuits
2008
·
Jim Geelen
, Kasper Kabell
·
Journal of Combinatorial Theory Series B
·
28
Triples in Matroid Circuits
1986
·
P.D. Seymour
·
European Journal of Combinatorics
·
25
PDF
Cones, lattices and Hilbert bases of circuits and perfect matchings
1993
·
Luis A. Goddyn
·
Contemporary mathematics - American Mathematical Society
·
24
Circuits and Hurwitz action in finite root systems
2016
·
Lewis, Joel Brewster
, Reiner, Victor
·
arXiv (Cornell University)
·
21
PDF
The maximum and minimum number of circuits and bases of matroids
2004
·
I. DÃ sa
, Claude Laflamme
·
Pure mathematics and applications
·
21
Efficient Enumeration of Solutions Produced by Closure Operations
2015
·
Mary, Arnaud
, Strozecki, Yann
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
19
PDF
On the intersections of circuits and cocircuits in matroids
1984
·
James G. Oxley
·
COMBINATORICA
·
19
Algorithms for Enumerating Circuits in Matroids
2003
·
Endre Boros
, Khaled Elbassioni
, et al.
·
Lecture notes in computer science
·
18
Matroids with an infinite circuit–cocircuit intersection
2014
·
Nathan Bowler
, Johannes Carmesin
·
Journal of Combinatorial Theory Series B
·
16
PDF
Loops of Clutters
1990
·
Michel Marie Deza
, Komei Fukuda
·
The IMA volumes in mathematics and its applications
·
16
Bracing cubic grids—a necessary condition
1988
·
András Recski
·
Discrete Mathematics
·
16
Packing and covering with matroid circuits
1980
·
P.D Seymour
·
Journal of Combinatorial Theory Series B
·
15
PDF
An extremal problem for non-separable matroids
1971
·
George W. Dinolt
·
Lecture notes in mathematics
·
15
k-regular matroids
1998
·
Charles Semple
·
Discrete Mathematics & Theoretical Computer Science
·
14
On the existence of uncountably many matroidal families
1979
·
Rüdiger Schmidt
·
Discrete Mathematics
·
14
A constructive characterisation of circuits in the simple (2,2) -sparsity matroid
2014
·
Anthony Nixon
·
European Journal of Combinatorics
·
13
PDF
Sublinear circuits and the constrained signomial nonnegativity problem
2022
·
Riley Murray
, Helen Naumann
, et al.
·
Mathematical Programming
·
12
PDF
Show more works
View as search
Works count:
151
Citation count:
1,373
Year
Topic
Type