| Publication | Date of Publication | Type |
|---|
| Graphs with no even holes and no sector wheels are the union of two chordal graphs | 2024-09-30 | Paper |
| Looms | 2024-09-27 | Paper |
| Bounded-diameter tree-decompositions | 2024-05-31 | Paper |
| Almost fair perfect matchings in complete bipartite graphs | 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 | 2023-08-11 | Paper |
| Rainbow paths and large rainbow matchings | 2022-02-01 | Paper |
| Tournaments and the strong Erdős-Hajnal property | 2022-01-07 | Paper |
| Finding an induced path that is not a shortest path | 2021-06-14 | Paper |
| Fractionally balanced hypergraphs and rainbow KKM theorems | 2020-11-02 | Paper |
| Cooperative colorings of trees and of bipartite graphs | 2020-02-10 | Paper |
| Large rainbow matchings in general graphs | 2019-06-18 | Paper |
| Treewidth of grid subsets | 2019-05-23 | Paper |
| On the Erdős-Hajnal conjecture for six-vertex tournaments | 2018-11-15 | Paper |
| Cliques in the union of \(C_4\)-free graphs | 2018-09-14 | Paper |
| A condition for assured 3-face-colorability of infinite plane graphs with a given spanning tree | 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 | 2018-03-16 | Paper |
| Fair Representation by Independent Sets | 2018-02-26 | Paper |
| Degree Conditions for Matchability in 3‐Partite Hypergraphs | 2018-02-23 | Paper |
| Fair representation in dimatroids | 2018-01-18 | Paper |
| On a conjecture of Stein | 2018-01-05 | Paper |
| Fair representation in the intersection of two matroids | 2017-10-16 | Paper |
| On rainbow matchings in bipartite graphs | 2017-02-13 | Paper |
| Eigenvalues of K1,k-Free Graphs and the Connectivity of Their Independence Complexes | 2016-11-17 | Paper |
| Two disjoint independent bases in matroid-graph pairs | 2015-09-24 | Paper |
| Cliques in the union of graphs | 2015-06-22 | Paper |
| Forcing large transitive subtournaments | 2015-05-04 | Paper |
| Kernels in weighted digraphs | 2014-06-12 | Paper |
| Tournaments and colouring | 2013-01-18 | Paper |
| A unified approach to known and unknown cases of Berge's conjecture | 2012-11-23 | Paper |
| The edge covering number of the intersection of two matroids | 2012-01-11 | Paper |
| Eulerian edge sets in locally finite graphs | 2011-12-20 | Paper |
| Strongly maximal antichains in posets | 2011-08-08 | Paper |
| The Max-Flow Min-Cut theorem for countable networks | 2011-01-14 | Paper |
| Rainbow matchings in \(r\)-partite \(r\)-graphs | 2010-03-26 | Paper |
| Correct Hardware Design and Verification Methods | 2010-02-05 | Paper |
| Menger's theorem for infinite graphs | 2009-05-05 | Paper |
| Strongly maximal matchings in infinite graphs | 2009-04-07 | Paper |
| Acyclic systems of representatives and acyclic colorings of digraphs | 2009-02-20 | Paper |
| Independence-domination duality | 2008-12-08 | Paper |
| The Grothendieck constant of random and pseudo-random graphs | 2008-10-29 | Paper |
| A note on the edge cover number and independence number in hypergraphs | 2008-05-13 | Paper |
| Proof of Berge's strong path partition conjecture for \(k=2\) | 2007-11-30 | Paper |
| Independent systems of representatives in weighted graphs | 2007-11-12 | Paper |
| The intersection of a matroid and a simplicial complex | 2007-02-01 | Paper |
| Eigenvalues and homology of flag complexes and vector representations of graphs | 2005-11-14 | Paper |
| KKM -- a topological approach for trees | 2005-10-04 | Paper |
| A tree version of Kőnig's theorem | 2003-05-18 | Paper |
| Dynamic monopolies of constant size | 2002-12-10 | Paper |
| The number of edges in critical strongly connected graphs | 2002-06-19 | Paper |
| Bounded diameter tree-decompositions | N/A | Paper |
