![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Ron Aharoni
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j96]Ron Aharoni, Eli Berger, Joseph Briggs, He Guo
, Shira Zerbib:
Looms. Discret. Math. 347(12): 114181 (2024) - [j95]Ron Aharoni, Joseph Briggs
:
Correction: Choice Functions. Order 41(1): 279 (2024) - 2023
- [j94]Ron Aharoni, Joseph Briggs
, Jinha Kim, Minki Kim:
Rainbow independent sets in certain classes of graphs. J. Graph Theory 104(3): 557-584 (2023) - [j93]Ron Aharoni, Joseph Briggs
:
Choice Functions. Order 40(1): 217-235 (2023) - [j92]Ron Aharoni, Eli Berger, Maria Chudnovsky
, He Guo
, Shira Zerbib
:
Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture. SIAM J. Discret. Math. 37(3): 1704-1714 (2023) - [i5]Ron Aharoni, He Guo:
Tight infinite matrices. CoRR abs/2301.10312 (2023) - [i4]Ron Aharoni, Eli Berger, Joseph Briggs, He Guo:
Looms. CoRR abs/2309.03735 (2023) - [i3]Ron Aharoni, Eli Berger, He Guo, Daniel Kotlar
:
2-covers of wide Young diagrams. CoRR abs/2311.17670 (2023) - 2022
- [j91]Ron Aharoni, Eli Berger, Joseph Briggs
, Erel Segal-Halevi, Shira Zerbib:
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems. Comb. 42(6): 913-951 (2022) - [j90]Ron Aharoni, Joseph Briggs
, Minho Cho
, Jinha Kim
:
Cooperative Conditions for the Existence of Rainbow Matchings. Electron. J. Comb. 29(1) (2022) - [j89]Ron Aharoni, Eli Berger, Maria Chudnovsky
, Shira Zerbib:
Rainbow Paths and Large Rainbow Matchings. Electron. J. Comb. 29(1) (2022) - 2021
- [j88]Ron Aharoni, Joseph Briggs
, Jinha Kim
, Minki Kim
:
Badges and rainbow matchings. Discret. Math. 344(6): 112363 (2021) - [j87]Ron Aharoni, Joseph Briggs
, Ron Holzman
, Zilin Jiang
:
Rainbow Odd Cycles. SIAM J. Discret. Math. 35(4): 2293-2303 (2021) - [i2]Ron Aharoni, He Guo:
Rainbow cycles for families of matchings. CoRR abs/2110.14332 (2021) - 2020
- [j86]Ron Aharoni, Eli Berger, Maria Chudnovsky
, Frédéric Havet, Zilin Jiang
:
Cooperative Colorings of Trees and of Bipartite Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j85]Ron Aharoni
, Shira Zerbib
:
A generalization of Tuza's conjecture. J. Graph Theory 94(3): 445-462 (2020)
2010 – 2019
- 2019
- [j84]Ron Aharoni, Ron Holzman, Zilin Jiang
:
Rainbow Fractional Matchings. Comb. 39(6): 1191-1202 (2019) - [j83]Ron Aharoni
, Eli Berger, Maria Chudnovsky
, David M. Howard, Paul D. Seymour
:
Large rainbow matchings in general graphs. Eur. J. Comb. 79: 222-227 (2019) - [j82]Ron Aharoni, Irina Gorelik:
Weighted Domination of Independent Sets. Graphs Comb. 35(3): 719-727 (2019) - [j81]Ron Aharoni
, Matt DeVos, Ron Holzman:
Rainbow triangles and the Caccetta-Häggkvist conjecture. J. Graph Theory 92(4): 347-360 (2019) - 2018
- [j80]Ron Aharoni, Yair Censor
, Zilin Jiang
:
Finding a best approximation pair of points for two polyhedra. Comput. Optim. Appl. 71(2): 509-523 (2018) - [j79]Ron Aharoni, Daniel Soltész:
Independent Sets in the Union of Two Hamiltonian Cycles. Electron. J. Comb. 25(4): 4 (2018) - [j78]Ron Aharoni, Irina Gorelik:
Independence-domination duality in weighted graphs. Discret. Math. 341(8): 2332-2336 (2018) - [j77]Ron Aharoni, Dani Kotlar
, Ran Ziv:
Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv. Eur. J. Comb. 67: 222-229 (2018) - [j76]Ron Aharoni, Noga Alon, Michal Amir, Penny Haxell, Dan Hefetz
, Zilin Jiang
, Gal Kronenberg
, Alon Naor:
Ramsey-nice families of graphs. Eur. J. Comb. 72: 29-44 (2018) - [j75]Ron Aharoni, Eli Berger, Dani Kotlar
, Ran Ziv:
Degree Conditions for Matchability in 3-Partite Hypergraphs. J. Graph Theory 87(1): 61-71 (2018) - 2017
- [j74]Ron Aharoni, Tomás Kaiser
, Shira Zerbib:
Fractional covers and matchings in families of weighted d-intervals. Comb. 37(4): 555-572 (2017) - [j73]Ron Aharoni, Eli Berger, Dani Kotlar
, Ran Ziv:
Fair Representation in the Intersection of Two Matroids. Electron. J. Comb. 24(4): 4 (2017) - [j72]Ron Aharoni, David M. Howard:
A Rainbow r-Partite Version of the Erdős-Ko-Rado Theorem. Comb. Probab. Comput. 26(3): 321-337 (2017) - [j71]Ron Aharoni, Ron Holzman
, Shira Zerbib:
Edge-Covers in d-Interval Hypergraphs. Discret. Comput. Geom. 58(3): 650-662 (2017) - [j70]Ron Aharoni, Eli Berger, Dani Kotlar
, Ran Ziv:
Fair representation in dimatroids. Electron. Notes Discret. Math. 61: 5-11 (2017) - [j69]Ron Aharoni, Eli Berger, Dani Kotlar
, Ran Ziv:
Topological methods for the existence of a rainbow matching. Electron. Notes Discret. Math. 63: 479-484 (2017) - [j68]Ron Aharoni, David M. Howard:
Cross-intersecting pairs of hypergraphs. J. Comb. Theory A 148: 15-26 (2017) - [j67]Ron Aharoni, Dani Kotlar
, Ran Ziv:
Representation of Large Matchings in Bipartite Graphs. SIAM J. Discret. Math. 31(3): 1726-1731 (2017) - 2016
- [j66]Ron Aharoni, C. J. Argue:
Covers in partitioned intersecting hypergraphs. Eur. J. Comb. 51: 222-226 (2016) - [j65]Ron Aharoni, Eli Berger, Dani Kotlar
, Ran Ziv:
On rainbow matchings in bipartite graphs. Electron. Notes Discret. Math. 54: 33-38 (2016) - [j64]Ron Aharoni, János Barát
, Ian M. Wanless:
Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture. Graphs Comb. 32(1): 1-15 (2016) - [j63]Ron Aharoni
, Daniel Kotlar
, Ran Ziv:
Rainbow sets in the intersection of two matroids. J. Comb. Theory B 118: 129-136 (2016) - [j62]Ron Aharoni, Noga Alon, Eli Berger:
Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes. J. Graph Theory 83(4): 384-391 (2016) - 2015
- [j61]Ron Aharoni, Ron Holzman, David M. Howard, Philipp Sprüssel:
Cooperative Colorings and Independent Systems of Representatives. Electron. J. Comb. 22(2): 2 (2015) - [j60]Ron Aharoni, Eli Berger, Philipp Sprüssel
:
Two Disjoint Independent Bases in Matroid-Graph Pairs. Graphs Comb. 31(5): 1107-1116 (2015) - [j59]Ron Aharoni, Eli Berger, Maria Chudnovsky
, Juba Ziani:
Cliques in the union of graphs. J. Comb. Theory B 114: 170-186 (2015) - [j58]Ron Aharoni, Pierre Charbit
, David M. Howard:
On a Generalization of the Ryser-Brualdi-Stein Conjecture. J. Graph Theory 78(2): 143-156 (2015) - 2014
- [j57]Ron Aharoni, Eli Berger, Irina Gorelik:
Kernels in Weighted Digraphs. Order 31(1): 35-43 (2014) - [j56]Ron Aharoni, Daniel Kotlar
:
A Weak Version of Rota's Bases Conjecture for Odd Dimensions. SIAM J. Discret. Math. 28(1): 385-393 (2014) - 2013
- [j55]Ron Aharoni, Daniel Kotlar
, Ran Ziv:
Rainbow Sets in the Intersection of Two Matroids. Electron. Notes Discret. Math. 43: 39-42 (2013) - [p1]Ron Aharoni:
A Few Remarks on a Conjecture of Erdős on the Infinite Version of Menger's Theorem. The Mathematics of Paul Erdős II 2013: 335-352 - [i1]Ron Aharoni, Pierre Charbit, David M. Howard:
On a Generalization of the Ryser-Brualdi-Stein Conjecture. CoRR abs/1305.6164 (2013) - 2012
- [j54]Ron Aharoni, Eli Berger, Ran Ziv:
The edge covering number of the intersection of two matroids. Discret. Math. 312(1): 81-85 (2012) - 2011
- [j53]Ron Aharoni, Eli Berger:
Strongly maximal antichains in posets. Discret. Math. 311(15): 1518-1522 (2011) - [j52]Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel
:
The Max-Flow Min-Cut theorem for countable networks. J. Comb. Theory B 101(1): 1-17 (2011)
2000 – 2009
- 2009
- [j51]Ron Aharoni, Eli Berger:
Rainbow Matchings in r-Partite r-Graphs. Electron. J. Comb. 16(1) (2009) - [j50]Ron Aharoni, Tibor Szabó:
Vizing's conjecture for chordal graphs. Discret. Math. 309(6): 1766-1768 (2009) - [j49]Ron Aharoni, Erol Hallufgil:
Coloring by two-way independent sets. Discret. Math. 309(14): 4853-4860 (2009) - [j48]Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel
:
Perfect matchings in r-partite r-graphs. Eur. J. Comb. 30(1): 39-42 (2009) - 2008
- [j47]Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Philipp Sprüssel:
Strongly Maximal Matchings in Infinite Graphs. Electron. J. Comb. 15(1) (2008) - [j46]Ron Aharoni, Eli Berger, Ron Holzman, Ori Kfir:
Independence - domination duality. J. Comb. Theory B 98(6): 1259-1270 (2008) - [j45]Ron Aharoni, Eli Berger, Ori Kfir:
Acyclic systems of representatives and acyclic colorings of digraphs. J. Graph Theory 59(3): 177-189 (2008) - 2007
- [j44]Ron Aharoni, Eli Berger, Ran Ziv:
Independent systems of representatives in weighted graphs. Comb. 27(3): 253-267 (2007) - 2003
- [j43]Ron Aharoni, Tamás Fleiner:
On a lemma of Scarf. J. Comb. Theory B 87(1): 72-80 (2003) - 2002
- [j42]Ron Aharoni, Eli Berger, Ran Ziv:
A Tree Version of Konig's Theorem. Comb. 22(3): 335-343 (2002) - [j41]Ron Aharoni, Ron Holzman, Michael Krivelevich, Roy Meshulam:
Fractional Planks. Discret. Comput. Geom. 27(4): 585-602 (2002) - [j40]Ron Aharoni, Maria Chudnovsky
, Andrei Kotlov:
Triangulated Spheres and Colored Cliques. Discret. Comput. Geom. 28(2): 223-229 (2002) - [c2]Ron Aharoni, Tamás Fleiner:
On a Lemma of Scarf. IPCO 2002: 176-187 - 2001
- [j39]Ron Aharoni:
Ryser's Conjecture for Tripartite 3-Graphs. Comb. 21(1): 1-4 (2001) - [j38]Ron Aharoni, Eli Berger:
The number of edges in critical strongly connected graphs. Discret. Math. 234(1-3): 119-123 (2001) - [j37]Ron Aharoni, Delman Lee:
On the achievability of the Cramér-Rao bound for Poisson distribution. IEEE Trans. Inf. Theory 47(5): 2096-2100 (2001) - 2000
- [j36]Ron Aharoni, Penny Haxell:
Hall's theorem for hypergraphs. J. Graph Theory 35(2): 83-88 (2000)
1990 – 1999
- 1998
- [j35]Ron Aharoni, Ron Holzman:
Fractional Kernels in Digraphs. J. Comb. Theory B 73(1): 1-6 (1998) - 1997
- [j34]Ron Aharoni, Gabor T. Herman, Attila Kuba:
Binary vectors partially determined by linear equation systems. Discret. Math. 171(1-3): 1-16 (1997) - 1996
- [j33]Ron Aharoni, Ron Holzman, Michael Krivelevich:
On a Theorem of Lovász on Covers in tau-Partite Hypergraphs. Comb. 16(2): 149-174 (1996) - [j32]Ron Aharoni, Gabor T. Herman, Martin Loebl
:
Jordan Graphs. CVGIP Graph. Model. Image Process. 58(4): 345-359 (1996) - [j31]Ron Aharoni, Uri Keich
:
A generalization of the Ahlswede-Daykin inequality. Discret. Math. 152(1-3): 1-12 (1996) - 1994
- [j30]Ron Aharoni, Reinhard Diestel:
Menger's Theorem for a Countable Source Set. Comb. Probab. Comput. 3: 145-156 (1994) - [j29]Ron Aharoni, Vladimir Korman:
Strong LP duality in weighted infinite bipartite graphs. Discret. Math. 131(1-3): 1-7 (1994) - 1993
- [j28]Ron Aharoni, Irith Ben-Arroyo Hartman:
On Greene-Kleitman's theorem for general digraphs. Discret. Math. 120(1-3): 13-24 (1993) - [j27]Ron Aharoni:
On a criterion for matchability in hypergraphs. Graphs Comb. 9(2-4): 209-212 (1993) - 1992
- [j26]Ron Aharoni, Ron Holzman:
Optimal fractional matchings and covers in infinite hypergraphs: Existence and duality. Graphs Comb. 8(1): 11-22 (1992) - [j25]Ron Aharoni, Menachem Magidor, Richard A. Shore:
On the strength of König's duality theorem for infinite bipartite graphs. J. Comb. Theory B 54(2): 257-290 (1992) - [j24]Ron Aharoni, Ron Holzman:
How to Guess Two Letters Correctly. J. Comb. Theory A 61(1): 1-12 (1992) - 1991
- [j23]Ron Aharoni:
Infinite matching theory. Discret. Math. 95(1-3): 5-22 (1991) - 1990
- [j22]Ron Aharoni, Rachel Manber, Bronislaw Wajnryb:
Special parity of perfect matchings in bipartite graphs. Discret. Math. 79(3): 221-228 (1990) - [j21]Ron Aharoni, Ofra Kessler:
On a possible extension of Hall's theorem to bipartite hypergraphs. Discret. Math. 84(3): 309-313 (1990) - [j20]Ron Aharoni, E. C. Milner, Karel Prikry:
Unfriendly partitions of a graph. J. Comb. Theory B 50(1): 1-10 (1990) - [j19]Ron Aharoni, Ran Ziv:
LP duality in infinite hypergraphs. J. Comb. Theory B 50(1): 82-92 (1990) - [j18]Ron Aharoni, Mao Lin Zheng:
Counting 1-factors in infinite graphs. J. Comb. Theory B 50(2): 168-178 (1990)
1980 – 1989
- 1989
- [j17]Ron Aharoni, Carsten Thomassen:
Infinite, highly connected digraphs with no two arc-disjoint spanning trees. J. Graph Theory 13(1): 71-74 (1989) - 1988
- [j16]Ron Aharoni, Paul Erdös, Nathan Linial:
Optima of dual integer linear programs. Comb. 8(1): 13-20 (1988) - [j15]Ron Aharoni:
Matchings in infinite graphs. J. Comb. Theory B 44(1): 87-125 (1988) - 1987
- [j14]Ron Aharoni:
Menger's theorem for countable graphs. J. Comb. Theory B 43(3): 303-313 (1987) - [j13]Ron Aharoni, Péter Komjáth:
On k-transversals. J. Comb. Theory A 45(1): 1-7 (1987) - 1986
- [j12]Ron Aharoni, Nathan Linial:
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Comb. Theory A 43(2): 196-204 (1986) - 1985
- [j11]Ron Aharoni:
Fractional matchings and covers in infinite hypergraphs. Comb. 5(3): 181-184 (1985) - [j10]Ron Aharoni:
Matchings inn-partiten-graphs. Graphs Comb. 1(1): 303-304 (1985) - [c1]Ron Aharoni, Paul Erdös, Nathan Linial:
Dual Integer Linear Programs and the Relationship between their Optima. STOC 1985: 476-483 - 1984
- [j9]Ron Aharoni:
On an obstruction for perfect matching. Comb. 4(1): 1-7 (1984) - [j8]Ron Aharoni:
Matchings in graphs of size N1. J. Comb. Theory B 36(1): 113-117 (1984) - [j7]Ron Aharoni:
A generalization of Tutte's 1-factor theorem to countable graphs. J. Comb. Theory B 37(3): 199-209 (1984) - 1983
- [j6]Ron Aharoni:
A principle of symmetry in networks. Discret. Math. 44(1): 1-11 (1983) - [j5]Ron Aharoni:
Menger's Theorem for Graphs Containing no Infinite Paths. Eur. J. Comb. 4(3): 201-204 (1983) - [j4]Ron Aharoni:
On the Equivalence of Two Conditions for the Existence of Transversals. J. Comb. Theory A 34(2): 202-214 (1983) - 1980
- [j3]Ron Aharoni:
A problem in rearrangements of (0, 1) matrices. Discret. Math. 30(3): 191-201 (1980) - [j2]Ron Aharoni:
Representing Matrices. J. Comb. Theory A 29(2): 151-165 (1980) - [j1]Ron Aharoni:
Extreme Symmetric Doubly Stochastic Matrices. J. Comb. Theory A 29(2): 263-265 (1980)
Coauthor Index
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint