The following pages link to Ron Aharoni (Q186189):
Displaying 50 items.
- Rainbow sets in the intersection of two matroids (Q256994) (← links)
- Two disjoint independent bases in matroid-graph pairs (Q497297) (← links)
- Covers in partitioned intersecting hypergraphs (Q499465) (← links)
- Cross-intersecting pairs of hypergraphs (Q507820) (← links)
- On rainbow matchings in bipartite graphs (Q510529) (← links)
- Menger's theorem for graphs containing no infinite paths (Q594106) (← links)
- The Max-Flow Min-Cut theorem for countable networks (Q618031) (← links)
- The edge covering number of the intersection of two matroids (Q658021) (← links)
- Independent sets in the union of two Hamiltonian cycles (Q668015) (← links)
- Fractional covers and matchings in families of weighted \(d\)-intervals (Q681591) (← links)
- On Greene-Kleitman's theorem for general digraphs (Q687099) (← links)
- On a criterion for matchability in hypergraphs (Q687713) (← links)
- On a possible extension of Hall's theorem to bipartite hypergraphs (Q750464) (← links)
- Unfriendly partitions of a graph (Q753841) (← links)
- On an obstruction for perfect matchings (Q793753) (← links)
- A generalization of Tutte's 1-factor theorem to countable graphs (Q800941) (← links)
- LP duality in infinite hypergraphs (Q803165) (← links)
- Ryser's conjecture for tripartite 3-graphs (Q873644) (← links)
- Independence-domination duality (Q958688) (← links)
- Strongly maximal matchings in infinite graphs (Q1010872) (← links)
- Menger's theorem for infinite graphs (Q1016232) (← links)
- Vizing's conjecture for chordal graphs (Q1024500) (← links)
- Coloring by two-way independent sets (Q1044959) (← links)
- On the equivalence of two conditions for the existence of transversals (Q1055410) (← links)
- Matchings in graphs of size \(\aleph_ 1\) (Q1055786) (← links)
- Successive projections on hyperplanes (Q1058267) (← links)
- (Q1061133) (redirect page) (← links)
- Path partitions and packs of acyclic digraphs (Q1061135) (← links)
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas (Q1087560) (← links)
- Menger's theorem for countable graphs (Q1094433) (← links)
- Transversals for ordinal intervals (Q1095907) (← links)
- Matchings in infinite graphs (Q1101134) (← links)
- Optima of dual integer linear programs (Q1105488) (← links)
- On k-transversals (Q1106212) (← links)
- Fractional matchings and covers in infinite hypergraphs (Q1115456) (← links)
- The Menger property for infinite ordered sets (Q1123915) (← links)
- Extreme symmetric doubly stochastic matrices (Q1145196) (← links)
- Representing matrices (Q1146676) (← links)
- A problem in rearrangements of (0,1)-matrices (Q1156137) (← links)
- An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
- Optimal fractional matchings and covers in infinite hypergraphs: existence and duality (Q1187944) (← links)
- Infinite matching theory (Q1191911) (← links)
- On the strength of König's duality theorem for infinite bipartite graphs (Q1193566) (← links)
- How to guess two letters correctly (Q1194746) (← links)
- Greene-Kleitman's theorem for infinite posets (Q1207720) (← links)
- Strong LP duality in weighted infinite bipartite graphs (Q1332441) (← links)
- Fourier transform imitations (Q1355213) (← links)
- Binary vectors partially determined by linear equation systems (Q1363682) (← links)
- Fractional kernels in digraphs (Q1366601) (← links)
- On a lemma of Scarf. (Q1403911) (← links)
