Eli Berger

According to our database1, Eli Berger authored at least 37 papers between 2001 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2019
On the Erdős-Hajnal conjecture for six-vertex tournaments.
Eur. J. Comb., 2019

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

2018
Degree Conditions for Matchability in 3-Partite Hypergraphs.
J. Graph Theory, 2018

Cliques in the Union of C<sub>4</sub>-Free Graphs.
Graphs Comb., 2018

A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree.
Discret. Math., 2018

Treewidth of Grid Subsets.
Comb., 2018

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

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

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

Unfriendly partitions for graphs not containing a subdivision of an infinite clique.
Comb., 2017

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

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

2015
Forcing large transitive subtournaments.
J. Comb. Theory, Ser. B, 2015

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

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

2014
Kernels in Weighted Digraphs.
Order, 2014

2013
Tournaments and colouring.
J. Comb. Theory, Ser. B, 2013

2012
A unified approach to known and unknown cases of Berge's conjecture.
J. Graph Theory, 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

Eulerian edge sets in locally finite graphs.
Comb., 2011

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

Proof of Berge's strong path partition conjecture for k=2.
Eur. J. Comb., 2008

A note on the edge cover number and independence number in hypergraphs.
Discret. Math., 2008

The Grothendieck constant of random and pseudo-random graphs.
Discret. Optim., 2008

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

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

2005
On Non-Approximability for Quadratic Programs
Electron. Colloquium Comput. Complex., 2005

2004
KKM-A Topological Approach For Trees.
Comb., 2004

2003
An Optimized Symbolic Bounded Model Checking Engine.
Proceedings of the Correct Hardware Design and Verification Methods, 2003

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

2001
Dynamic Monopolies of Constant Size.
J. Comb. Theory, Ser. B, 2001

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


  Loading...