Ron Aharoni

According to our database1, Ron Aharoni authored at least 92 papers between 1980 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2022
Rainbow Paths and Large Rainbow Matchings.
Electron. J. Comb., 2022

Cooperative Conditions for the Existence of Rainbow Matchings.
Electron. J. Comb., 2022

2021
Rainbow Odd Cycles.
SIAM J. Discret. Math., 2021

Badges and rainbow matchings.
Discret. Math., 2021

Rainbow cycles for families of matchings.
CoRR, 2021

2020
A generalization of Tuza's conjecture.
J. Graph Theory, 2020

Cooperative Colorings of Trees and of Bipartite Graphs.
Electron. J. Comb., 2020

2019
Rainbow triangles and the Caccetta-Häggkvist conjecture.
J. Graph Theory, 2019

Weighted Domination of Independent Sets.
Graphs Comb., 2019

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

Rainbow Fractional Matchings.
Comb., 2019

2018
Degree Conditions for Matchability in 3-Partite Hypergraphs.
J. 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.
Discret. Math., 2018

Independent Sets in the Union of Two Hamiltonian Cycles.
Electron. J. Comb., 2018

Finding a best approximation pair of points for two polyhedra.
Comput. Optim. Appl., 2018

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

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

Topological methods for the existence of a rainbow matching.
Electron. Notes Discret. Math., 2017

Fair representation in dimatroids.
Electron. Notes Discret. Math., 2017

Edge-Covers in d-Interval Hypergraphs.
Discret. Comput. Geom., 2017

A Rainbow r-Partite Version of the Erdős-Ko-Rado Theorem.
Comb. Probab. Comput., 2017

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

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

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

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

On rainbow matchings in bipartite graphs.
Electron. Notes Discret. Math., 2016

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

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

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

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

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

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

Kernels in Weighted Digraphs.
Order, 2014

2013
Rainbow Sets in the Intersection of Two Matroids.
Electron. Notes Discret. Math., 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

2012
The edge covering number of the intersection of two matroids.
Discret. Math., 2012

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

Strongly maximal antichains in posets.
Discret. Math., 2011

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

Vizing's conjecture for chordal graphs.
Discret. Math., 2009

Coloring by two-way independent sets.
Discret. Math., 2009

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

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

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

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

2007
Independent systems of representatives in weighted graphs.
Comb., 2007

2003
On a lemma of Scarf.
J. Comb. Theory, Ser. B, 2003

2002
Fractional Planks.
Discret. Comput. Geom., 2002

Triangulated Spheres and Colored Cliques.
Discret. Comput. Geom., 2002

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

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

The number of edges in critical strongly connected graphs.
Discret. Math., 2001

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

2000
Hall's theorem for hypergraphs.
J. Graph Theory, 2000

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

1997
Binary vectors partially determined by linear equation systems.
Discret. Math., 1997

1996
A generalization of the Ahlswede-Daykin inequality.
Discret. Math., 1996

Jordan Graphs.
CVGIP Graph. Model. Image Process., 1996

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

1994
Strong LP duality in weighted infinite bipartite graphs.
Discret. Math., 1994

Menger's Theorem for a Countable Source Set.
Comb. Probab. Comput., 1994

1993
On a criterion for matchability in hypergraphs.
Graphs Comb., 1993

On Greene-Kleitman's theorem for general digraphs.
Discret. Math., 1993

1992
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 Comb., 1992

1991
Infinite matching theory.
Discret. Math., 1991

1990
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.
Discret. Math., 1990

On a possible extension of Hall's theorem to bipartite hypergraphs.
Discret. Math., 1990

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

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

Optima of dual integer linear programs.
Comb., 1988

1987
On <i>k</i>-transversals.
J. Comb. Theory, Ser. A, 1987

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

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

1985
Matchings in<i>n</i>-partite<i>n</i>-graphs.
Graphs Comb., 1985

Fractional matchings and covers in infinite hypergraphs.
Comb., 1985

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

1984
Matchings in graphs of size <i>N</i><sub>1</sub>.
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.
Comb., 1984

1983
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.
Discret. Math., 1983

1980
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.
Discret. Math., 1980


  Loading...