The following pages link to Manoel Lemos (Q215022):
Displaying 50 items.
- Strong splitter theorem (Q404393) (← links)
- Matroids with at least two regular elements (Q427790) (← links)
- A decomposition theorem for binary matroids with no prism minor (Q489315) (← links)
- On chains of matroids in the weak order (Q491754) (← links)
- The number of elements belonging to triads in 3-connected binary matroids (Q501058) (← links)
- Dirac's theorem on simplicial matroids (Q659777) (← links)
- Almost-graphic matroids (Q696817) (← links)
- On the number of non-isomorphic matroids (Q705233) (← links)
- On matroids with few circuits containing a pair of elements (Q764898) (← links)
- Matroids with a unique non-common circuit containing a fixed element (Q776269) (← links)
- On the number of triangles in 3-connected matroids (Q872054) (← links)
- On the circuit-cocircuit intersection conjecture (Q882788) (← links)
- Relations between the circumference and \(e\)-circumference of a matroid (Q937245) (← links)
- The 3-connected matroids with circumference 6 (Q965999) (← links)
- Removing circuits in 3-connected binary matroids (Q1011697) (← links)
- The 3-connected binary matroids with circumference 6 or 7 (Q1041600) (← links)
- An extension of Lindström's result about characteristic sets of matroids (Q1093646) (← links)
- On 3-connected matroids (Q1118602) (← links)
- \(k\)-elimination property for circuits of matroids (Q1174778) (← links)
- Matroids having the same connectivity function (Q1332425) (← links)
- Uniqueness of the decomposition of the rank function of a 2-polymatroid (Q1402075) (← links)
- Matroids with many common bases. (Q1406555) (← links)
- On the minor-minimal 3-connected matroids having a fixed minor. (Q1414641) (← links)
- The reconstruction of a matroid from its connectivity function (Q1567616) (← links)
- On size, circumference and circuit removal in 3-connected matroids (Q1567617) (← links)
- On packing minors into connected matroids (Q1584372) (← links)
- On the 3-connected matroids that are minimal having a fixed restriction (Q1586582) (← links)
- Improving a chain theorem for triangle-free 3-connected matroids (Q1686252) (← links)
- Non-separating cocircuits in binary matroids (Q1826820) (← links)
- On the minor-minimal 2-connected graphs having a fixed minor (Q1827674) (← links)
- On the connectivity function of a binary matroid (Q1850627) (← links)
- Elements belonging to triads in 3-connected matroids (Q1877659) (← links)
- On triangle-free 3-connected matroids (Q1931408) (← links)
- On the 3-connected matroids that are minimal having a fixed spanning restriction (Q1978152) (← links)
- A matroid operation that commutes with duality (Q2124645) (← links)
- Obstructions to a binary matroid being graphic (Q2275474) (← links)
- On the circuit-spectrum of binary matroids (Q2275475) (← links)
- Non-separating cocircuits avoiding some elements (Q2343473) (← links)
- A characterization of graphic matroids using non-separating cocircuits (Q2377964) (← links)
- Elements belonging to triangles in 3-connected matroids (Q2433737) (← links)
- Pairs of largest circuits in 3-connected matroids (Q2459975) (← links)
- Non-separating cocircuits in matroids (Q2482097) (← links)
- Matroids with few non-common bases (Q2488944) (← links)
- Weight distribution of the bases of a matroid (Q2494120) (← links)
- An excluded-minor problem in matroids (Q2576467) (← links)
- Matroid packing and covering with circuits through an element (Q2581505) (← links)
- An upper bound for the circumference of a 3-connected binary matroid (Q2692185) (← links)
- A sharp bound on the size of a connected matroid (Q2723463) (← links)
- Matroids having small circumference (Q2757077) (← links)
- Characterizing 3-connected planar graphs and graphic matroids (Q3055913) (← links)
