Regular matroid

Results: 6



#Item
1Mathematics / Matroid theory / Combinatorics / Discrete mathematics / Matroid / Jack Edmonds / Weighted matroid / Regular matroid / Dual matroid / Submodular set function / Graphic matroid / Book:Matroid Theory

143 Documenta Math. The Coming of the Matroids William H. Cunningham

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2012-07-25 10:24:53
2Mathematics / Matroid theory / Matroid / Polynomials / Oriented matroid / Quadratic function / Factorization / Linear programming / Book:Matroid Theory / Regular matroid

137 Doc. Math. J. DMV Two Interesting Oriented Matroids

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2014-07-13 07:29:14
3Mathematics / Matroid theory / Combinatorics / Discrete mathematics / Matroid / Jack Edmonds / Weighted matroid / Regular matroid / Dual matroid / Submodular set function / Graphic matroid / Book:Matroid Theory

143 Documenta Math. The Coming of the Matroids William H. Cunningham

Add to Reading List

Source URL: documenta.sagemath.org

Language: English - Date: 2012-07-25 10:24:53
4Matroid theory / Matroid / Polynomials / Oriented matroid / Quadratic function / Factorization / Linear programming / Book:Matroid Theory / Regular matroid

137 Doc. Math. J. DMV Two Interesting Oriented Matroids

Add to Reading List

Source URL: www.math.uiuc.edu

Language: English - Date: 2014-07-13 07:29:14
5Regular graph / Connectivity / Random regular graph / Graph / Matroid theory / Planar separator theorem / Line graph / Graph theory / Random graphs / Degree

A CRITICAL POINT FOR RANDOM GRAPHS WITH A GIVEN DEGREE SEQUENCE Michael Molloy Department of Mathematics Carnegie-Mellon University

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2011-12-04 14:11:42
6Random regular graph / Matroid theory / Graph / Connectivity / Regular graph / Pseudoforest / Line graph / Graph theory / Mathematics / Random graphs

The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d ≥ 3, almost all d-regular graphs on {1, 2, . . . , n} have edge-expansion ratio at least cd d (if nd is even), where

Add to Reading List

Source URL: snap.stanford.edu

Language: English - Date: 2012-10-02 14:35:23
UPDATE