Menger's theorem for matroids
From MaRDI portal
Publication:5530481
DOI10.6028/JRES.069B.002zbMATH Open0151.33802OpenAlexW2329866321MaRDI QIDQ5530481FDOQ5530481
Authors: William T. Tutte 
Publication date: 1965
Published in: Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.069b.002
Recommendations
Cited In (50)
- Tverberg-type theorems for matroids: a counterexample and a proof
- Graph-like continua, augmenting arcs, and Menger's theorem
- Axioms for infinite matroids
- Tangles, tree-decompositions and grids in matroids
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
- Ore-type and Dirac-type theorems for matroids
- A unique factorization theorem for matroids
- The contributions of W.T. Tutte to matroid theory
- Finite connectivity in infinite matroids
- The Möbius matroids
- On the minor-minimal 3-connected matroids having a fixed minor.
- Degrees of \(M\)-fuzzy families of independent \(L\)-fuzzy sets
- Branch decomposition heuristics for linear matroids
- The Petersen matroid
- Title not available (Why is that?)
- Branch-width and well-quasi-ordering in matroids and graphs.
- Triples in matroid circuits
- Intertwining Connectivities for Vertex-Minors and Pivot-Minors
- Representability of matroids with a large projective geometry minor
- A Tverberg type theorem for matroids
- Whitney Connectivity of Matroids
- Branch-width and Rota's conjecture
- A formal approach to Menger's theorem
- Generalized networks: Networks embedded on a matroid, part I
- A chain theorem for matroids
- On Rota's conjecture and excluded minors containing large projective geometries.
- A proof of Menger's Theorem by contraction
- An Erdős-Gallai theorem for matroids
- Countable Menger's theorem with finitary matroid constraints on the ingoing edges
- Minimum separators and Menger's theorem
- A generalization of Menger's theorem
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Title not available (Why is that?)
- More proofs of menger's theorem
- Generalized networks: Networks embedded on a matroid, part II
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Sticky matroids and Kantor's conjecture
- Inequivalent representations of matroids over prime fields
- Turán's triangle theorem and binary matroids
- König's theorem and bimatroids
- Rank-width and vertex-minors
- Vertex-minors of graphs: a survey
- Menger's theorem
- Excluding a line from complex-representable matroids
- Title not available (Why is that?)
- Circuit preserving edge maps. II
- Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
- On chains of 3-connected matroids
- Obstructions to branch-decomposition of matroids
- Title not available (Why is that?)
This page was built for publication: Menger's theorem for matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5530481)
