| Publication | Date of Publication | Type |
|---|
Tree automata and pigeonhole classes of matroids. II
The Electronic Journal of Combinatorics | 2023-08-10 | Paper |
The optimal bound on the 3-independence number obtainable from a polynomial-type method
Discrete Mathematics | 2023-05-15 | Paper |
| Counting closed walks in infinite regular trees using Catalan and Borel's triangles | 2022-12-16 | Paper |
Tree automata and pigeonhole classes of matroids. I
Algorithmica | 2022-06-28 | Paper |
Defining Bicircular Matroids in Monadic Logic
The Quarterly Journal of Mathematics | 2022-03-29 | Paper |
Fractal classes of matroids
Advances in Applied Mathematics | 2021-04-23 | Paper |
Defining bicircular matroids in monadic logic
(available as arXiv preprint) | 2020-05-09 | Paper |
Extending factorizations of complete uniform hypergraphs
Combinatorica | 2019-05-23 | Paper |
Binary covering arrays on tournaments
The Electronic Journal of Combinatorics | 2018-06-27 | Paper |
Yes, the ``missing axiom'' of matroid theory is lost forever
Transactions of the American Mathematical Society | 2018-05-23 | Paper |
On the b-chromatic number of Cartesian products
Discrete Applied Mathematics | 2018-03-21 | Paper |
Graph-intersecting set systems and LYM inequalities
Discrete Mathematics | 2016-12-22 | Paper |
Embedding factorizations for 3-uniform hypergraphs II: r-factorizations into s-factorizations
The Electronic Journal of Combinatorics | 2016-06-01 | Paper |
Bounds on polygons of higher rank numerical ranges
Linear Algebra and its Applications | 2015-05-06 | Paper |
Obstacles to decomposition theorems for sixth-root-of-unity matroids
Annals of Combinatorics | 2015-05-05 | Paper |
Is the missing axiom of matroid theory lost forever?
The Quarterly Journal of Mathematics | 2015-01-22 | Paper |
Yes, the "missing axiom" of matroid theory is lost forever
(available as arXiv preprint) | 2014-12-29 | Paper |
A note on packing spanning trees in graphs and bases in matroids
The Australasian Journal of Combinatorics | 2014-08-15 | Paper |
A note on packing spanning trees in graphs and bases in matroids
The Australasian Journal of Combinatorics | 2014-08-15 | Paper |
| Vertex-colouring edge-weightings with two edge weights | 2014-03-25 | Paper |
On the asymptotic proportion of connected matroids
European Journal of Combinatorics | 2011-08-09 | Paper |
Digraphs are 2-weight choosable
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
Digraphs are 2-weight choosable
The Electronic Journal of Combinatorics | 2011-02-17 | Paper |
On excluded minors for real-representability
Journal of Combinatorial Theory. Series B | 2009-06-23 | Paper |
On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
European Journal of Combinatorics | 2009-06-17 | Paper |
Coloring an Orthogonality Graph
SIAM Journal on Discrete Mathematics | 2009-05-27 | Paper |
On the quantum chromatic number of a graph
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On the quantum chromatic number of a graph
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On the quantum chromatic number of a graph
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Eigenvalue bounds for independent sets
Journal of Combinatorial Theory. Series B | 2008-07-24 | Paper |
Independent sets in association schemes
Combinatorica | 2007-01-08 | Paper |
