Eli Berger, Ph.D. - Publications

Affiliations: 
2004 Princeton University, Princeton, NJ 

35 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Aharoni R, Berger E, Chudnovsky M, Havet F, Jiang Z. Cooperative colorings of trees and of bipartite graphs Electronic Journal of Combinatorics. 27. DOI: 10.37236/8111  0.627
2019 Aharoni R, Berger E, Chudnovsky M, Howard DM, Seymour PD. Large rainbow matchings in general graphs European Journal of Combinatorics. 79: 222-227. DOI: 10.1016/J.Ejc.2019.01.012  0.656
2019 Berger E, Choromanski K, Chudnovsky M. On the Erdős–Hajnal conjecture for six-vertex tournaments European Journal of Combinatorics. 75: 113-122. DOI: 10.1016/J.Ejc.2018.08.007  0.646
2018 Berger E, Soker Y. A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree Discrete Mathematics. 341: 2919-2924. DOI: 10.1016/J.Disc.2018.04.005  0.451
2018 Othman A, Berger E. Cliques in the union of $C_4$-free graphs Graphs and Combinatorics. 34: 607-612. DOI: 10.1007/S00373-018-1898-4  0.386
2017 Aharoni R, Berger E, Kotlar D, Ziv R. Fair Representation in the Intersection of Two Matroids Electronic Journal of Combinatorics. 24: 4-10. DOI: 10.37236/6946  0.36
2017 Aharoni R, Berger E, Kotlar D, Ziv R. Topological methods for the existence of a rainbow matching Electronic Notes in Discrete Mathematics. 63: 479-484. DOI: 10.1016/J.Endm.2017.11.046  0.442
2017 Aharoni R, Berger E, Kotlar D, Ziv R. Fair representation in dimatroids Electronic Notes in Discrete Mathematics. 61: 5-11. DOI: 10.1016/J.Endm.2017.06.014  0.349
2017 Aharoni R, Berger E, Kotlar D, Ziv R. On a conjecture of Stein Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. 87: 203-211. DOI: 10.1007/S12188-016-0160-3  0.375
2017 Berger E, Dvořák Z, Norin S. Treewidth of grid subsets Combinatorica. 38: 1337-1352. DOI: 10.1007/S00493-017-3538-5  0.415
2017 Berger E. Unfriendly partitions for graphs not containing a subdivision of an infinite clique Combinatorica. 37: 157-166. DOI: 10.1007/S00493-015-3261-1  0.509
2016 Aharoni R, Berger E, Kotlar D, Ziv R. On rainbow matchings in bipartite graphs Electronic Notes in Discrete Mathematics. 54: 33-38. DOI: 10.1016/J.Endm.2016.09.007  0.464
2015 Aharoni R, Berger E, Chudnovsky M, Ziani J. Cliques in the union of graphs Journal of Combinatorial Theory. Series B. 114: 170-186. DOI: 10.1016/J.Jctb.2015.04.004  0.614
2015 Berger E, Choromanski K, Chudnovsky M. Forcing large transitive subtournaments Journal of Combinatorial Theory. Series B. 112: 1-17. DOI: 10.1016/J.Jctb.2014.11.003  0.685
2015 Aharoni R, Alon N, Berger E. Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes Journal of Graph Theory. DOI: 10.1002/Jgt.22004  0.499
2014 Aharoni R, Berger E, Gorelik I. Kernels in Weighted Digraphs Order. 31: 35-43. DOI: 10.1007/S11083-013-9286-4  0.367
2014 Aharoni R, Berger E, Sprüssel P. Two Disjoint Independent Bases in Matroid-Graph Pairs Graphs and Combinatorics. 31: 1107-1116. DOI: 10.1007/S00373-014-1439-8  0.526
2013 Berger E, Choromanski K, Chudnovsky M, Fox J, Loebl M, Scott A, Seymour P, Thomassé S. Tournaments and colouring Journal of Combinatorial Theory. Series B. 103: 1-20. DOI: 10.1016/J.Jctb.2012.08.003  0.677
2012 Berger E, Hartman IB. A unified approach to known and unknown cases of Berge's conjecture Journal of Graph Theory. 71: 317-330. DOI: 10.1002/Jgt.20648  0.372
2011 Berger E, Bruhn H. Eulerian edge sets in locally finite graphs Combinatorica. 31: 21-38. DOI: 10.1007/S00493-011-2572-0  0.476
2009 Aharoni R, Berger E. Rainbow Matchings in $r$-Partite $r$-Graphs Electronic Journal of Combinatorics. 16: 119. DOI: 10.37236/208  0.395
2009 Aharoni R, Berger E. Menger’s theorem for infinite graphs Inventiones Mathematicae. 176: 1-62. DOI: 10.1007/S00222-008-0157-3  0.496
2008 Aharoni R, Berger E, Georgakopoulos A, Sprüssel P. Strongly Maximal Matchings in Infinite Graphs Electronic Journal of Combinatorics. 15: 136. DOI: 10.37236/860  0.456
2008 Aharoni R, Berger E, Holzman R, Kfir O. Independence---domination duality Journal of Combinatorial Theory, Series B. 98: 1259-1270. DOI: 10.1016/J.Jctb.2008.02.001  0.425
2008 Berger E, Hartman IB. Proof of Berge's strong path partition conjecture for k=2 European Journal of Combinatorics. 29: 179-192. DOI: 10.1016/J.Ejc.2006.10.003  0.362
2008 Alon N, Berger E. The Grothendieck constant of random and pseudo-random graphs Discrete Optimization. 5: 323-327. DOI: 10.1016/J.Disopt.2006.06.004  0.46
2008 Berger E, Ziv R. A note on the edge cover number and independence number in hypergraphs Discrete Mathematics. 308: 2649-2654. DOI: 10.1016/J.Disc.2007.05.006  0.366
2008 Aharoni R, Berger E, Kfir O. Acyclic systems of representatives and acyclic colorings of digraphs Journal of Graph Theory. 59: 177-189. DOI: 10.1002/Jgt.V59:3  0.497
2007 Aharoni R, Berger E, Ziv R. Independent systems of representatives in weighted graphs Combinatorica. 27: 253-267. DOI: 10.1007/S00493-007-2086-Y  0.497
2006 Aharoni R, Berger E. The intersection of a matroid and a simplicial complex Transactions of the American Mathematical Society. 358: 4895-4917. DOI: 10.1090/S0002-9947-06-03833-5  0.494
2005 Aharoni R, Berger E, Meshulam R. Eigenvalues and homology of flag complexes and vector representations of graphs Geometric and Functional Analysis. 15: 555-566. DOI: 10.1007/S00039-005-0516-9  0.448
2004 Berger E. KKM—A Topological Approach For Trees Combinatorica. 25: 1-18. DOI: 10.1007/S00493-005-0001-Y  0.402
2002 Aharoni R, Berger E, Ziv R. A tree version of Konig's theorem Combinatorica. 22: 335-343. DOI: 10.1007/S004930200016  0.497
2001 Aharoni R, Berger E. The number of edges in critical strongly connected graphs Discrete Mathematics. 234: 119-123. DOI: 10.1016/S0012-365X(00)00395-2  0.508
2001 Berger E. Dynamic monopolies of constant size Journal of Combinatorial Theory. Series B. 83: 191-200. DOI: 10.1006/Jctb.2001.2045  0.397
Show low-probability matches.