Publication | Date of Publication | Type |
---|
Recent progress towards Hadwiger's conjecture | 2024-03-20 | Paper |
Cops and Robbers on \(\boldsymbol{P_5}\)-Free Graphs | 2024-03-14 | Paper |
On 2-cycles of graphs | 2023-08-10 | Paper |
Every graph is eventually Turán-good | 2023-08-10 | Paper |
The Spectrum of Triangle-Free Graphs | 2023-06-22 | Paper |
Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor | 2023-04-27 | Paper |
Clustered colouring of graph classes with bounded treedepth or pathwidth | 2023-04-03 | Paper |
Extremal functions for sparse minors | 2023-01-18 | Paper |
Connectivity and choosability of graphs with no \(K_t\) minor | 2022-11-23 | Paper |
Counterexamples to a Conjecture of Harris on Hall Ratio | 2022-07-28 | Paper |
Non-bipartite \(k\)-common graphs | 2022-06-30 | Paper |
A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor | 2022-06-30 | Paper |
Drawing 4-Pfaffian graphs on the torus | 2022-06-29 | Paper |
Descending the stable matching lattice: how many strategic agents are required to turn pessimality to optimality? | 2022-06-01 | Paper |
Torsion groups do not act on 2-dimensional \(\text{CAT}(0)\) complexes | 2022-04-25 | Paper |
Obstructions for partitioning into forests and outerplanar graphs | 2022-03-24 | Paper |
Sublinear Separators in Intersection Graphs of Convex Shapes | 2021-06-10 | Paper |
VIRTUALLY FIBERING RIGHT-ANGLED COXETER GROUPS | 2021-06-09 | Paper |
Bounding the number of cycles in a graph in terms of its degree sequence | 2021-02-08 | Paper |
Asymptotic density of graphs excluding disconnected minors | 2021-02-03 | Paper |
A lower bound on the average degree forcing a minor | 2020-06-15 | Paper |
Clustered colouring in minor-closed classes | 2020-02-26 | Paper |
A Turán theorem for extensions via an Erdős-Ko-Rado theorem for Lagrangians | 2020-01-17 | Paper |
List coloring with requests | 2019-12-30 | Paper |
A DISTRIBUTION ON TRIPLES WITH MAXIMUM ENTROPY MARGINAL | 2019-12-10 | Paper |
Treewidth of graphs with balanced separations | 2019-07-17 | Paper |
\(K_{6}\) minors in 6-connected graphs of bounded tree-width | 2019-06-17 | Paper |
Treewidth of grid subsets | 2019-05-23 | Paper |
Distribution of coefficients of rank polynomials for random sparse graphs | 2019-03-05 | Paper |
On the boundary of the region defined by homomorphism densities | 2019-01-28 | Paper |
Corrigendum: Orthogonal Tree Decompositions of Graphs | 2018-12-19 | Paper |
A bound on the inducibility of cycles | 2018-11-08 | Paper |
Orthogonal Tree Decompositions of Graphs | 2018-04-11 | Paper |
Counting flags in triangle-free digraphs | 2018-03-16 | Paper |
\(K_{6}\) minors in large 6-connected graphs | 2018-02-09 | Paper |
Turán numbers of extensions | 2018-01-12 | Paper |
Large Supports are required for Well-Supported Nash Equilibria | 2017-08-31 | Paper |
The extremal function for disconnected minors | 2017-08-22 | Paper |
New tools and results in graph minor structure theory | 2016-12-20 | Paper |
Turán number of generalized triangles | 2016-11-29 | Paper |
Non-planar extensions of subdivisions of planar graphs | 2016-10-12 | Paper |
Erdős-Szekeres without induction | 2016-09-07 | Paper |
Strongly Sublinear Separators and Polynomial Expansion | 2016-05-26 | Paper |
Flag algebras and the stable coefficients of the Jones polynomial | 2015-09-30 | Paper |
Sparse halves in dense triangle-free graphs | 2015-08-21 | Paper |
Rank of divisors on tropical curves | 2015-06-19 | Paper |
Excluding a Substar and an Antisubstar | 2015-05-20 | Paper |
Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3 | 2015-01-12 | Paper |
A Near-Optimal Mechanism for Impartial Selection | 2015-01-07 | Paper |
The inducibility of blow-up graphs | 2014-10-22 | Paper |
A counterexample to a conjecture of Schwartz | 2014-05-30 | Paper |
Counting flags in triangle-free digraphs | 2013-10-10 | Paper |
The Entropy of Random-Free Graphons and Properties | 2013-07-26 | Paper |
On the number of pentagons in triangle-free graphs | 2013-03-06 | Paper |
Holographic algorithms without matchgates | 2013-01-16 | Paper |
Non-Three-Colourable Common Graphs Exist | 2012-09-12 | Paper |
Jacobians of nearly complete and threshold graphs | 2011-11-29 | Paper |
Turán Graphs and the Number of Colorings | 2011-10-27 | Paper |
Exponentially many perfect matchings in cubic graphs | 2011-07-25 | Paper |
Circular consecutive choosability of k-choosable graphs | 2011-07-21 | Paper |
Undecidability of linear inequalities in graph homomorphism densities | 2011-04-04 | Paper |
Voting in Agreeable Societies | 2010-12-01 | Paper |
Markov bases of binary graph models of \(K_{4}\)-minor free graphs | 2010-08-11 | Paper |
Small graph classes and bounded expansion | 2010-04-21 | Paper |
Harmonic Morphisms and Hyperelliptic Graphs | 2009-08-24 | Paper |
Circular degree choosability | 2009-04-07 | Paper |
Circular choosability via combinatorial Nullstellensatz | 2009-02-20 | Paper |
Pfaffian graphs, \(T\)-joins and crossing numbers | 2008-10-21 | Paper |
Pfaffian labelings and signs of edge colorings | 2008-10-21 | Paper |
Minimally non-Pfaffian graphs | 2008-10-07 | Paper |
Graphs with full rank 3-color matrix and few 3-colorings | 2008-10-07 | Paper |
On two questions about circular choosability | 2008-09-04 | Paper |
Riemann-Roch and Abel-Jacobi theory on a finite graph | 2007-10-05 | Paper |
Generating bricks | 2007-08-20 | Paper |
Unions of perfect matchings in cubic graphs | 2007-05-29 | Paper |
The circular chromatic index of flower snarks | 2007-03-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3424884 | 2007-03-05 | Paper |
Proper minor-closed families are small | 2006-08-16 | Paper |
Minimal bricks | 2006-07-12 | Paper |
Graph Drawing | 2005-12-07 | Paper |
A polynomial lower bound on the size of a \(k\)-min-wise independent set of permutations | 2005-08-05 | Paper |
A new proof of a characterisation of Pfaffian bipartite graphs | 2004-08-06 | Paper |