Ron Aharoni

According to our database1, Ron Aharoni authored at least 82 papers between 1980 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.



In proceedings 
PhD thesis 




Weighted Domination of Independent Sets.
Graphs and Combinatorics, 2019

Large rainbow matchings in general graphs.
Eur. J. Comb., 2019

Degree Conditions for Matchability in 3-Partite Hypergraphs.
Journal of Graph Theory, 2018

Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv.
Eur. J. Comb., 2018

Ramsey-nice families of graphs.
Eur. J. Comb., 2018

Independence-domination duality in weighted graphs.
Discrete Mathematics, 2018

Finding a best approximation pair of points for two polyhedra.
Comp. Opt. and Appl., 2018

Representation of Large Matchings in Bipartite Graphs.
SIAM J. Discrete Math., 2017

Cross-intersecting pairs of hypergraphs.
J. Comb. Theory, Ser. A, 2017

Topological methods for the existence of a rainbow matching.
Electronic Notes in Discrete Mathematics, 2017

Fair representation in dimatroids.
Electronic Notes in Discrete Mathematics, 2017

Edge-Covers in d-Interval Hypergraphs.
Discrete & Computational Geometry, 2017

A Rainbow r-Partite Version of the Erdős-Ko-Rado Theorem.
Combinatorics, Probability & Computing, 2017

Fair Representation in the Intersection of Two Matroids.
Electr. J. Comb., 2017

Fractional covers and matchings in families of weighted d-intervals.
Combinatorica, 2017

Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes.
Journal of Graph Theory, 2016

Rainbow sets in the intersection of two matroids.
J. Comb. Theory, Ser. B, 2016

Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture.
Graphs and Combinatorics, 2016

On rainbow matchings in bipartite graphs.
Electronic Notes in Discrete Mathematics, 2016

Covers in partitioned intersecting hypergraphs.
Eur. J. Comb., 2016

On a Generalization of the Ryser-Brualdi-Stein Conjecture.
Journal of Graph Theory, 2015

Cliques in the union of graphs.
J. Comb. Theory, Ser. B, 2015

Two Disjoint Independent Bases in Matroid-Graph Pairs.
Graphs and Combinatorics, 2015

Cooperative Colorings and Independent Systems of Representatives.
Electr. J. Comb., 2015

A Weak Version of Rota's Bases Conjecture for Odd Dimensions.
SIAM J. Discrete Math., 2014

Kernels in Weighted Digraphs.
Order, 2014

Rainbow Sets in the Intersection of Two Matroids.
Electronic Notes in Discrete Mathematics, 2013

A Few Remarks on a Conjecture of Erdős on the Infinite Version of Menger's Theorem.
Proceedings of the Mathematics of Paul Erdős II, 2013

The edge covering number of the intersection of two matroids.
Discrete Mathematics, 2012

The Max-Flow Min-Cut theorem for countable networks.
J. Comb. Theory, Ser. B, 2011

Strongly maximal antichains in posets.
Discrete Mathematics, 2011

Perfect matchings in r-partite r-graphs.
Eur. J. Comb., 2009

Vizing's conjecture for chordal graphs.
Discrete Mathematics, 2009

Coloring by two-way independent sets.
Discrete Mathematics, 2009

Rainbow Matchings in r-Partite r-Graphs.
Electr. J. Comb., 2009

Acyclic systems of representatives and acyclic colorings of digraphs.
Journal of Graph Theory, 2008

Independence - domination duality.
J. Comb. Theory, Ser. B, 2008

Strongly Maximal Matchings in Infinite Graphs.
Electr. J. Comb., 2008

Independent systems of representatives in weighted graphs.
Combinatorica, 2007

Fractional Planks.
Discrete & Computational Geometry, 2002

A Tree Version of Konig's Theorem.
Combinatorica, 2002

On a Lemma of Scarf.
Proceedings of the Integer Programming and Combinatorial Optimization, 2002

On the achievability of the Cramér-Rao bound for Poisson distribution.
IEEE Trans. Information Theory, 2001

The number of edges in critical strongly connected graphs.
Discrete Mathematics, 2001

Ryser's Conjecture for Tripartite 3-Graphs.
Combinatorica, 2001

Hall's theorem for hypergraphs.
Journal of Graph Theory, 2000

Fractional Kernels in Digraphs.
J. Comb. Theory, Ser. B, 1998

Binary vectors partially determined by linear equation systems.
Discrete Mathematics, 1997

A generalization of the Ahlswede-Daykin inequality.
Discrete Mathematics, 1996

Jordan Graphs.
CVGIP: Graphical Model and Image Processing, 1996

On a Theorem of Lovász on Covers in tau-Partite Hypergraphs.
Combinatorica, 1996

Strong LP duality in weighted infinite bipartite graphs.
Discrete Mathematics, 1994

Menger's Theorem for a Countable Source Set.
Combinatorics, Probability & Computing, 1994

On a criterion for matchability in hypergraphs.
Graphs and Combinatorics, 1993

On Greene-Kleitman's theorem for general digraphs.
Discrete Mathematics, 1993

On the strength of König's duality theorem for infinite bipartite graphs.
J. Comb. Theory, Ser. B, 1992

How to Guess Two Letters Correctly.
J. Comb. Theory, Ser. A, 1992

Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality.
Graphs and Combinatorics, 1992

Infinite matching theory.
Discrete Mathematics, 1991

Counting 1-factors in infinite graphs.
J. Comb. Theory, Ser. B, 1990

LP duality in infinite hypergraphs.
J. Comb. Theory, Ser. B, 1990

Unfriendly partitions of a graph.
J. Comb. Theory, Ser. B, 1990

Special parity of perfect matchings in bipartite graphs.
Discrete Mathematics, 1990

On a possible extension of Hall's theorem to bipartite hypergraphs.
Discrete Mathematics, 1990

Infinite, highly connected digraphs with no two arc-disjoint spanning trees.
Journal of Graph Theory, 1989

Matchings in infinite graphs.
J. Comb. Theory, Ser. B, 1988

Optima of dual integer linear programs.
Combinatorica, 1988

On k-transversals.
J. Comb. Theory, Ser. A, 1987

Menger's theorem for countable graphs.
J. Comb. Theory, Ser. B, 1987

Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas.
J. Comb. Theory, Ser. A, 1986

Matchings inn-partiten-graphs.
Graphs and Combinatorics, 1985

Fractional matchings and covers in infinite hypergraphs.
Combinatorica, 1985

Dual Integer Linear Programs and the Relationship between their Optima
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Matchings in graphs of size N1.
J. Comb. Theory, Ser. B, 1984

A generalization of Tutte's 1-factor theorem to countable graphs.
J. Comb. Theory, Ser. B, 1984

On an obstruction for perfect matching.
Combinatorica, 1984

On the Equivalence of Two Conditions for the Existence of Transversals.
J. Comb. Theory, Ser. A, 1983

Menger's Theorem for Graphs Containing no Infinite Paths.
Eur. J. Comb., 1983

A principle of symmetry in networks.
Discrete Mathematics, 1983

Extreme Symmetric Doubly Stochastic Matrices.
J. Comb. Theory, Ser. A, 1980

Representing Matrices.
J. Comb. Theory, Ser. A, 1980

A problem in rearrangements of (0, 1) matrices.
Discrete Mathematics, 1980