zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Matroids and the greedy algorithm. (English) Zbl 0253.90027

MSC:
90C05Linear programming
References:
[1]Jack Edmonds, ”Maximum matching and a polyhedron with {0, 1}-vertices,”Journal of Research of the National Bureau of Standards 69B (1965) 125–130.
[2]Jack Edmonds, ”Matroid partition, Math. of the Decision Sciences,”American Mathematical Society Lectures in Applied Mathematics 11 (1968) pp. 335–345.
[3]Jack Edmonds, ”Optimum branchings,”Journal of Research of the National Bureau of Standards 71B (1967) 233–240; reprinted with [2], pp. 346–361.
[4]Jack Edmonds, ”Systems of distinct representatives and linear algebra,”Journal of Research National Bureau of Standards 71B (1967) 241–245.
[5]J.B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem,Proceedings American Mathematical Society 7 (1956) 48–50. · Zbl 0070.18404 · doi:10.1090/S0002-9939-1956-0078686-7
[6]P. Rosenstiehl, ”L’arbre minimum d’un graphe,”Proc. Int’l. Symp. on the Theory of Graphs in Rome 1966 (Dunod/Gordon-Breach, 1967).
[7]R. Rado, ”Note on independence functions,”Proceedings London Mathematical Society 7 (1957) 300–320. · Zbl 0083.02302 · doi:10.1112/plms/s3-7.1.300
[8]H. Whitney, ”On the abstract properties of linear dependence,”American Journal of Mathematics 57 (1935) 509–533. · doi:10.2307/2371182