Eli Berger

Discret. Math., April, 2024

2023

Nonuniform Degrees and Rainbow Versions of the Caccetta-Häggkvist Conjecture.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., September, 2023

2-covers of wide Young diagrams.

[BibT_eX]

[DOI]

CoRR, 2023

Universal Graph Random Features.

[BibT_eX]

[DOI]

Isaac Reid

Adrian Weller

CoRR, 2023

Repelling Random Walks.

[BibT_eX]

[DOI]

Isaac Reid

Krzysztof Marcin Choromanski

Adrian Weller

CoRR, 2023

Looms.

[BibT_eX]

[DOI]

CoRR, 2023

Efficient Graph Field Integrators Meet Point Clouds.

[BibT_eX]

[DOI]

Valerii Likhosherstov

Somnath Basu Roy Chowdhury

Proceedings of the International Conference on Machine Learning, 2023

2022

Fractionally Balanced Hypergraphs and Rainbow KKM Theorems.

[BibT_eX]

[DOI]

Comb., December, 2022

Tournaments and the strong Erdős-Hajnal Property.

[BibT_eX]

[DOI]

Maria Chudnovsky

Shira Zerbib

Eur. J. Comb., 2022

Rainbow Paths and Large Rainbow Matchings.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

Finding an induced path that is not a shortest path.

[BibT_eX]

[DOI]

Paul D. Seymour

Sophie Spirkl

Discret. Math., 2021

2020

Cooperative Colorings of Trees and of Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

On the Erdős-Hajnal conjecture for six-vertex tournaments.

[BibT_eX]

[DOI]

Maria Chudnovsky

Eur. J. Comb., 2019

Large rainbow matchings in general graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

2018

Degree Conditions for Matchability in 3-Partite Hypergraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

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

[BibT_eX]

[DOI]

Abeer Othman

Graphs Comb., 2018

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

[BibT_eX]

[DOI]

Yanay Soker

Discret. Math., 2018

Treewidth of Grid Subsets.

[BibT_eX]

[DOI]

Zdenek Dvorák

Sergey Norin

Comb., 2018

2017

Topological methods for the existence of a rainbow matching.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Fair representation in dimatroids.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Fair Representation in the Intersection of Two Matroids.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

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

[BibT_eX]

[DOI]

Comb., 2017

2016

Eigenvalues of K1, k-Free Graphs and the Connectivity of Their Independence Complexes.

[BibT_eX]

[DOI]

Noga Alon

J. Graph Theory, 2016

On rainbow matchings in bipartite graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2015

Forcing large transitive subtournaments.

[BibT_eX]

[DOI]

Maria Chudnovsky

J. Comb. Theory, Ser. B, 2015

Cliques in the union of graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2015

Two Disjoint Independent Bases in Matroid-Graph Pairs.

[BibT_eX]

[DOI]

Philipp Sprüssel

Graphs Comb., 2015

2014

Kernels in Weighted Digraphs.

[BibT_eX]

[DOI]

Irina Gorelik

Order, 2014

2013

Tournaments and colouring.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2013

2012

A unified approach to known and unknown cases of Berge's conjecture.

[BibT_eX]

[DOI]

Irith Ben-Arroyo Hartman

J. Graph Theory, 2012

The edge covering number of the intersection of two matroids.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

The Max-Flow Min-Cut theorem for countable networks.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

Amitai Perlstein

Philipp Sprüssel

J. Comb. Theory, Ser. B, 2011

Strongly maximal antichains in posets.

[BibT_eX]

[DOI]

Discret. Math., 2011

Eulerian edge sets in locally finite graphs.

[BibT_eX]

[DOI]

Henning Bruhn

Comb., 2011

2009

Rainbow Matchings in r-Partite r-Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Acyclic systems of representatives and acyclic colorings of digraphs.

[BibT_eX]

[DOI]

Ori Kfir

J. Graph Theory, 2008

Independence - domination duality.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2008

Proof of Berge's strong path partition conjecture for k=2.

[BibT_eX]

[DOI]

Irith Ben-Arroyo Hartman

Eur. J. Comb., 2008

A note on the edge cover number and independence number in hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

The Grothendieck constant of random and pseudo-random graphs.

[BibT_eX]

[DOI]

Noga Alon

Discret. Optim., 2008

Strongly Maximal Matchings in Infinite Graphs.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

Philipp Sprüssel

Electron. J. Comb., 2008

2007

Independent systems of representatives in weighted graphs.

[BibT_eX]

[DOI]

Comb., 2007

2005

On Non-Approximability for Quadratic Programs

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2005

2004

KKM-A Topological Approach For Trees.

[BibT_eX]

[DOI]

Comb., 2004

2003

An Optimized Symbolic Bounded Model Checking Engine.

[BibT_eX]

[DOI]

Proceedings of the Correct Hardware Design and Verification Methods, 2003

2002

A Tree Version of Konig's Theorem.

[BibT_eX]

[DOI]

Comb., 2002

2001

Dynamic Monopolies of Constant Size.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2001

The number of edges in critical strongly connected graphs.

[BibT_eX]

[DOI]