The following pages link to András Recski (Q226827):
Displayed 50 items.
- On the sum of matroids. III (Q1161526) (← links)
- Descriptively sufficient subcollections of flats in matroids (Q1174164) (← links)
- Representability of \(\bigtriangleup\)-matroids over \(GF(2)\) (Q1174313) (← links)
- The lattices of matroid bases and exact matroid bases (Q1176781) (← links)
- Elementary divisors of graphs and matroids (Q1178029) (← links)
- Delta matroids whose fundamental graphs are bipartite (Q1183130) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Valuated matroids (Q1191727) (← links)
- Paroids: A canonical format for combinatorial optimization (Q1199464) (← links)
- One-story buildings as tensegrity frameworks. III (Q1201101) (← links)
- Invertibility of the base Radon transform of a matroid (Q1201244) (← links)
- Applications of combinatorics to statics --- a second survey (Q1201249) (← links)
- On secret-sharing matroids (Q1204471) (← links)
- Matroid theory and its applications in electric network theory and in statics (Q1210828) (← links)
- On random partitions (Q1234693) (← links)
- The cocycle lattice of binary matroids (Q1260774) (← links)
- Note on a matroid with parity condition (Q1262317) (← links)
- The optimal path-matching problem (Q1272178) (← links)
- Covering a symmetric poset by symmetric chains (Q1272179) (← links)
- Intersection theorems for infinite families of convex sets in graphs (Q1276308) (← links)
- A two-spheres problem on homogeneous trees (Q1288907) (← links)
- On large systems of sets with no large weak \(\Delta\)-subsystems (Q1288909) (← links)
- Note on the number of triangulations of planar point sets (Q1288910) (← links)
- Algorithms for measuring perturbality in matroid optimization (Q1297736) (← links)
- A combinatorial algorithm for the minimum \((2,r)\)-metric problem and some generalizations (Q1297737) (← links)
- Small circuit double covers of cubic multigraphs (Q1322014) (← links)
- On paths of greedoids and a minor characterization (Q1329072) (← links)
- Strong duality property for matroids with coefficients (Q1329080) (← links)
- Elementary strong maps of graphic matroids. II (Q1334948) (← links)
- Every group is the automorphism group of a rank-3 matroid (Q1336195) (← links)
- On Rota's problem about \(n\) bases in a rank \(n\) matroid (Q1338865) (← links)
- König's theorem and bimatroids (Q1344070) (← links)
- Submodular functions and electrical networks (Q1359940) (← links)
- The Gallai-Younger conjecture for planar graphs (Q1375627) (← links)
- Note on exchange axioms for valuated matroids and valuated delta-matroids (Q1375629) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- A matroid generalization of a result of Dirac (Q1382409) (← links)
- An upper bound on the size of the snake-in-the-box (Q1382411) (← links)
- Two matroidal families on the edge set of a graph (Q1613478) (← links)
- Sparse quasi-random graphs (Q1848147) (← links)
- Transversals in uniform hypergraphs with property \((p,2)\) (Q1848148) (← links)
- Diophantine approximations and integer points of cones (Q1872892) (← links)
- Equicovering matroids by distinct bases (Q1891366) (← links)
- Combinatorial relaxation algorithm for the maximum degree of subdeterminants: Computing Smith-McMillan form at infinity and structural indices in Kronecker form (Q1894574) (← links)
- A theorem on the principal structure for independent matchings (Q1897351) (← links)
- The cocycle lattice of binary matroids. II (Q1899432) (← links)
- On the quasi-transversals of a matroid (Q1903738) (← links)
- Unconstrained multilayer switchbox routing (Q1904736) (← links)
- Non-Stanley bounds for network reliability (Q1906250) (← links)
- Principal structure of submodular systems and Hitchcock-type independent flows (Q1906849) (← links)