Dynamic monopolies of constant size E Berger
Journal of Combinatorial Theory, Series B 83 (2), 191-200, 2001
157 2001 Independent systems of representatives in weighted graphs R Aharoni, E Berger, R Ziv
Combinatorica 27 (3), 253-267, 2007
100 2007 Menger’s theorem for infinite graphs R Aharoni, E Berger
Inventiones mathematicae 176 (1), 1-62, 2009
98 2009 On non-approximability for quadratic programs S Arora, E Berger, H Elad, G Kindler, M Safra
46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 206-215, 2005
96 2005 Rainbow Matchings in R Aharoni, E Berger
the electronic journal of combinatorics, R119-R119, 2009
93 2009 The intersection of a matroid and a simplicial complex R Aharoni, E Berger
Transactions of the American Mathematical Society 358 (11), 4895-4917, 2006
84 2006 Tournaments and colouring E Berger, K Choromanski, M Chudnovsky, J Fox, M Loebl, A Scott, ...
Journal of Combinatorial Theory, Series B 103 (1), 1-20, 2013
76 2013 Eigenvalues and homology of flag complexes and vector representations of graphs R Aharoni, E Berger, R Meshulam
Geometric & Functional Analysis GAFA 15 (3), 555-566, 2005
43 2005 A Tree Version of Kőnig's Theorem R Aharoni, E Berger, R Ziv
Combinatorica 22 (3), 335-343, 2002
40 2002 The max-flow min-cut theorem for countable networks R Aharoni, E Berger, A Georgakopoulos, A Perlstein, P Sprüssel
Journal of Combinatorial Theory, Series B 101 (1), 1-17, 2011
34 2011 Large rainbow matchings in general graphs R Aharoni, E Berger, M Chudnovsky, D Howard, P Seymour
European Journal of Combinatorics 79, 222-227, 2019
30 2019 Forcing large transitive subtournaments E Berger, K Choromanski, M Chudnovsky
Journal of Combinatorial Theory, Series B 112, 1-17, 2015
30 2015 Eulerian edge sets in locally finite graphs E Berger, H Bruhn
Combinatorica 31, 21-38, 2011
24 2011 Proof of Berge’s strong path partition conjecture for k= 2 E Berger, IBA Hartman
European Journal of Combinatorics 29 (1), 179-192, 2008
22 2008 A note on the edge cover number and independence number in hypergraphs E Berger, R Ziv
Discrete Mathematics 308 (12), 2649-2654, 2008
17 2008 On the Erdős–Hajnal conjecture for six-vertex tournaments E Berger, K Choromanski, M Chudnovsky
European Journal of Combinatorics 75, 113-122, 2019
15 2019 Degree conditions for matchability in 3‐partite hypergraphs R Aharoni, E Berger, D Kotlar, R Ziv
Journal of Graph Theory 87 (1), 61-71, 2018
15 2018 Eigenvalues of‐Free Graphs and the Connectivity of Their Independence Complexes R Aharoni, N Alon, E Berger
Journal of Graph Theory 83 (4), 384-391, 2016
15 2016 Acyclic systems of representatives and acyclic colorings of digraphs R Aharoni, E Berger, O Kfir
Journal of Graph Theory 59 (3), 177-189, 2008
15 2008 KKM—a topological approach for trees E Berger
Combinatorica 1 (25), 1-18, 2004
14 2004 