Name
Abstract | ||
|---|---|---|
The critical problem of matroid theory can be posed in the more general context of finite relations. Given a relation R between the finite sets S and T, the critical problem is to determine the smallest number n such that there exists an n-tuple (u1,…, un) of elements from T such that for every x in S, there exists a u1 such that xRui. All the enumerative results, in particular, the Tutte decomposition and Möbius function formula, can be rephrased so that they still hold. In this way, we obtain a uniform approach to all the classical critical problems. |
Year | DOI | Venue |
|---|---|---|
1980 | 10.1016/0097-3165(80)90023-0 | Journal of Combinatorial Theory, Series A |
Field | DocType | Volume |
Matroid,Discrete mathematics,Combinatorics,Finite set,Existential quantification,Möbius function,Mathematics | Journal | 29 |
Issue | ISSN | Citations |
3 | 0097-3165 | 4 |
PageRank | References | Authors |
1.28 | 1 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Joseph P. S. Kung | 1 | 78 | 20.60 |