Parents
Sign in to add mentor| Paul D. Seymour | grad student | 2004 | Princeton | |
| (Topological methods in matching theory.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Aharoni R, Berger E, Chudnovsky M, et al. (2020) Cooperative colorings of trees and of bipartite graphs Electronic Journal of Combinatorics. 27 |
| Aharoni R, Berger E, Chudnovsky M, et al. (2019) Large rainbow matchings in general graphs European Journal of Combinatorics. 79: 222-227 |
| Berger E, Choromanski K, Chudnovsky M. (2019) On the Erdős–Hajnal conjecture for six-vertex tournaments European Journal of Combinatorics. 75: 113-122 |
| Berger E, Soker Y. (2018) A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree Discrete Mathematics. 341: 2919-2924 |
| Othman A, Berger E. (2018) Cliques in the union of $C_4$-free graphs Graphs and Combinatorics. 34: 607-612 |
| Aharoni R, Berger E, Kotlar D, et al. (2017) Fair Representation in the Intersection of Two Matroids Electronic Journal of Combinatorics. 24: 4-10 |
| Aharoni R, Berger E, Kotlar D, et al. (2017) Topological methods for the existence of a rainbow matching Electronic Notes in Discrete Mathematics. 63: 479-484 |
| Aharoni R, Berger E, Kotlar D, et al. (2017) Fair representation in dimatroids Electronic Notes in Discrete Mathematics. 61: 5-11 |
| Aharoni R, Berger E, Kotlar D, et al. (2017) On a conjecture of Stein Abhandlungen Aus Dem Mathematischen Seminar Der Universitat Hamburg. 87: 203-211 |
| Berger E, Dvořák Z, Norin S. (2017) Treewidth of grid subsets Combinatorica. 38: 1337-1352 |