| Publication | Date of Publication | Type |
|---|
Graphs with no even holes and no sector wheels are the union of two chordal graphs
European Journal of Combinatorics | 2024-09-30 | Paper |
Looms
Discrete Mathematics | 2024-09-27 | Paper |
Bounded-diameter tree-decompositions
Combinatorica | 2024-05-31 | Paper |
Almost fair perfect matchings in complete bipartite graphs
Discrete Mathematics | 2024-02-19 | Paper |
| 2-covers of wide Young diagrams | 2023-11-29 | Paper |
| Graphs with no even holes and no sector wheels are the union of two chordal graphs | 2023-10-09 | Paper |
| Looms | 2023-09-07 | Paper |
Nonuniform Degrees and Rainbow Versions of the Caccetta–Häggkvist Conjecture
SIAM Journal on Discrete Mathematics | 2023-08-11 | Paper |
Rainbow paths and large rainbow matchings
The Electronic Journal of Combinatorics | 2022-02-01 | Paper |
Tournaments and the strong Erdős-Hajnal property
European Journal of Combinatorics | 2022-01-07 | Paper |
Finding an induced path that is not a shortest path
Discrete Mathematics | 2021-06-14 | Paper |
| Fractionally balanced hypergraphs and rainbow KKM theorems | 2020-11-02 | Paper |
Cooperative colorings of trees and of bipartite graphs
The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
Cooperative colorings of trees and of bipartite graphs
The Electronic Journal of Combinatorics | 2020-02-10 | Paper |
Large rainbow matchings in general graphs
European Journal of Combinatorics | 2019-06-18 | Paper |
Treewidth of grid subsets
Combinatorica | 2019-05-23 | Paper |
On the Erdős-Hajnal conjecture for six-vertex tournaments
European Journal of Combinatorics | 2018-11-15 | Paper |
Cliques in the union of \(C_4\)-free graphs
Graphs and Combinatorics | 2018-09-14 | Paper |
A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree
Discrete Mathematics | 2018-08-15 | Paper |
| Topological methods for the existence of a rainbow matching | 2018-04-10 | Paper |
Unfriendly partitions for graphs not containing a subdivison of an infinite cycle
Combinatorica | 2018-03-16 | Paper |
Fair representation by independent sets
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Degree conditions for matchability in 3-partite hypergraphs
Journal of Graph Theory | 2018-02-23 | Paper |
| Fair representation in dimatroids | 2018-01-18 | Paper |
On a conjecture of Stein
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 2018-01-05 | Paper |
Fair representation in the intersection of two matroids
The Electronic Journal of Combinatorics | 2017-10-16 | Paper |
Fair representation in the intersection of two matroids
The Electronic Journal of Combinatorics | 2017-10-16 | Paper |
| On rainbow matchings in bipartite graphs | 2017-02-13 | Paper |
Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes
Journal of Graph Theory | 2016-11-17 | Paper |
Two disjoint independent bases in matroid-graph pairs
Graphs and Combinatorics | 2015-09-24 | Paper |
Cliques in the union of graphs
Journal of Combinatorial Theory. Series B | 2015-06-22 | Paper |
Forcing large transitive subtournaments
Journal of Combinatorial Theory. Series B | 2015-05-04 | Paper |
Kernels in weighted digraphs
Order | 2014-06-12 | Paper |
Tournaments and colouring
Journal of Combinatorial Theory. Series B | 2013-01-18 | Paper |
A unified approach to known and unknown cases of Berge's conjecture
Journal of Graph Theory | 2012-11-23 | Paper |
The edge covering number of the intersection of two matroids
Discrete Mathematics | 2012-01-11 | Paper |
Eulerian edge sets in locally finite graphs
Combinatorica | 2011-12-20 | Paper |
Strongly maximal antichains in posets
Discrete Mathematics | 2011-08-08 | Paper |
The Max-Flow Min-Cut theorem for countable networks
Journal of Combinatorial Theory. Series B | 2011-01-14 | Paper |
Rainbow matchings in \(r\)-partite \(r\)-graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
Rainbow matchings in \(r\)-partite \(r\)-graphs
The Electronic Journal of Combinatorics | 2010-03-26 | Paper |
An optimized symbolic bounded model checking engine
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Menger's theorem for infinite graphs
Inventiones Mathematicae | 2009-05-05 | Paper |
Strongly maximal matchings in infinite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Strongly maximal matchings in infinite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Strongly maximal matchings in infinite graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Acyclic systems of representatives and acyclic colorings of digraphs
Journal of Graph Theory | 2009-02-20 | Paper |
Independence-domination duality
Journal of Combinatorial Theory. Series B | 2008-12-08 | Paper |
The Grothendieck constant of random and pseudo-random graphs
Discrete Optimization | 2008-10-29 | Paper |
A note on the edge cover number and independence number in hypergraphs
Discrete Mathematics | 2008-05-13 | Paper |
Proof of Berge's strong path partition conjecture for \(k=2\)
European Journal of Combinatorics | 2007-11-30 | Paper |
Independent systems of representatives in weighted graphs
Combinatorica | 2007-11-12 | Paper |
The intersection of a matroid and a simplicial complex
Transactions of the American Mathematical Society | 2007-02-01 | Paper |
Eigenvalues and homology of flag complexes and vector representations of graphs
Geometric and Functional Analysis. GAFA | 2005-11-14 | Paper |
KKM -- a topological approach for trees
Combinatorica | 2005-10-04 | Paper |
A tree version of Kőnig's theorem
Combinatorica | 2003-05-18 | Paper |
Dynamic monopolies of constant size
Journal of Combinatorial Theory. Series B | 2002-12-10 | Paper |
The number of edges in critical strongly connected graphs
Discrete Mathematics | 2002-06-19 | Paper |
Bounded diameter tree-decompositions
(available as arXiv preprint) | N/A | Paper |
