| Publication | Date of Publication | Type |
|---|
| Local version of Vizing's theorem for multigraphs | 2025-01-06 | Paper |
| Forcing generalised quasirandom graphs efficiently | 2024-11-05 | Paper |
| Sharp bounds for decomposing graphs into edges and triangles | 2024-10-18 | Paper |
| On the \((6,4)\)-problem of Brown, Erdős, and Sós | 2024-06-27 | Paper |
| On the limit of the positive \(\ell\)-degree Turán problem | 2024-02-23 | Paper |
| Exact solutions to the Erdős-Rothschild problem | 2024-01-18 | Paper |
| A note on extremal constructions for the Erd\H{o}s--Rademacher problem | 2023-11-30 | Paper |
| Large deviation principles for graphon sampling | 2023-11-11 | Paper |
| Stability from graph symmetrisation arguments with applications to inducibility | 2023-09-15 | Paper |
| The codegree threshold of \(K_4^-\) | 2023-08-23 | Paper |
| Local version of Vizing's theorem for multi-graphs | 2023-06-07 | Paper |
| Hypergraph Turán densities can have arbitrarily large algebraic degree | 2023-05-02 | Paper |
| Disjoint isomorphic balanced clique subdivisions | 2023-05-02 | Paper |
| Stability for the Erdős-Rothschild problem | 2023-04-17 | Paper |
| Forcing Generalized Quasirandom Graphs Efficiently | 2023-03-07 | Paper |
| On a question of Vera T. Sós about size forcing of graphons | 2023-01-23 | Paper |
| Finite Hypergraph Families with Rich Extremal Tur\'an Constructions via Mixing Patterns | 2022-12-16 | Paper |
| Borel Combinatorics of Locally Finite Graphs | 2022-11-18 | Paper |
| Measurable equidecompositions for group actions with an expansion property | 2022-11-17 | Paper |
| On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os | 2022-09-28 | Paper |
| Circle Squaring with Pieces of Small Boundary and Low Borel Complexity | 2022-02-03 | Paper |
| New lower bounds on kissing numbers and spherical codes in high dimensions | 2021-11-01 | Paper |
| Sharp bounds for decomposing graphs into edges and triangles | 2021-06-15 | Paper |
| Stability for the Erd\H{o}s-Rothschild problem | 2021-05-20 | Paper |
| On a question of Vera T. S\'os about size forcing of graphons | 2021-03-16 | Paper |
| Large Deviation Principles for Block and Step Graphon Random Graph Models | 2021-01-18 | Paper |
| Asymptotic Structure for the Clique Density Theorem | 2021-01-16 | Paper |
| Divisibility of Spheres with Measurable Pieces | 2020-12-09 | Paper |
| Measurable versions of Vizing's theorem | 2020-10-08 | Paper |
| Supersaturation problem for the bowtie | 2020-06-16 | Paper |
| Isometric copies of directed trees in orientations of graphs | 2020-05-21 | Paper |
| THE EXACT MINIMUM NUMBER OF TRIANGLES IN GRAPHS WITH GIVEN ORDER AND SIZE | 2020-05-04 | Paper |
| Minimizing the number of 5-cycles in graphs with given edge-density | 2020-04-06 | Paper |
| Minimum number of additive tuples in groups of prime order | 2019-03-05 | Paper |
| Edges not in any monochromatic copy of a fixed graph | 2019-02-08 | Paper |
| Strong forms of stability from flag algebra calculations | 2019-02-08 | Paper |
| How unproportional must a graph be? | 2018-08-24 | Paper |
| The codegree threshold of \(K_4^-\) | 2018-01-18 | Paper |
| The minimum number of triangles in graphs of given order and size | 2018-01-18 | Paper |
| Supersaturation problem for the bowtie | 2018-01-18 | Paper |
| Asymptotic Structure of Graphs with the Minimum Number of Triangles | 2017-10-10 | Paper |
| Minimum Number of Monotone Subsequences of Length 4 in Permutations | 2017-10-04 | Paper |
| The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques | 2017-09-28 | Paper |
| Measurable circle squaring | 2017-04-05 | Paper |
| KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS | 2017-04-04 | Paper |
| Supersaturation problem for color-critical graphs | 2017-01-26 | Paper |
| Size Ramsey numbers involving large stars | 2016-07-01 | Paper |
| Monochromatic Clique Decompositions of Graphs | 2016-02-01 | Paper |
| Measurable equidecompositions for group actions with an expansion property | 2016-01-12 | Paper |
| The maximal length of a gap between \(r\)-graph Turán densities | 2015-11-02 | Paper |
| The Codegree Threshold for 3-Graphs with Independent Neighborhoods | 2015-09-02 | Paper |
| How to Play Dundee | 2015-08-26 | Paper |
| Poset limits can be totally ordered | 2015-04-22 | Paper |
| Coloring \(d\)-embeddable \(k\)-uniform hypergraphs | 2015-02-03 | Paper |
| Martin Gardner’s Minimum No-3-in-a-Line Problem | 2014-11-10 | Paper |
| On possible Turán densities | 2014-10-24 | Paper |
| Measurable equidecompositions via combinatorics and group theory | 2014-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419987 | 2014-06-11 | Paper |
| Minimum Number ofk-Cliques in Graphs with Bounded Independence Number | 2014-02-24 | Paper |
| On minimum saturated matrices | 2013-09-26 | Paper |
| A note on the Turán function of even cycles | 2013-09-03 | Paper |
| Primality of trees | 2013-07-30 | Paper |
| Quasirandom permutations are characterized by 4-point densities | 2013-06-25 | Paper |
| Exact computation of the hypergraph Turán function for expanded complete 2-graphs | 2013-04-17 | Paper |
| The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings | 2012-06-08 | Paper |
| Logical complexity of graphs: a survey | 2012-03-02 | Paper |
| Hypergraphs with independent neighborhoods | 2011-12-19 | Paper |
| The minimum size of 3-graphs without a 4-set spanning no or exactly three edges | 2011-11-29 | Paper |
| Set Systems without a Strong Simplex | 2011-06-17 | Paper |
| Flips in Graphs | 2011-06-17 | Paper |
| The saturation function of complete partite graphs | 2011-06-14 | Paper |
| Untangling planar graphs from a specified vertex position-Hard cases | 2011-05-17 | Paper |
| Maximizing the number of q -colorings | 2010-11-26 | Paper |
| An analytic approach to stability | 2010-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576654 | 2010-07-30 | Paper |
| Memoryless Rules for Achlioptas Processes | 2010-06-01 | Paper |
| Finding an Unknown Acyclic Orientation of a Given Graph | 2010-04-23 | Paper |
| Anti-Ramsey properties of random graphs | 2010-04-21 | Paper |
| Anti-Ramsey numbers of doubly edge-critical graphs | 2009-12-18 | Paper |
| The maximum size of hypergraphs without generalized 4-cycles | 2009-06-17 | Paper |
| Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree | 2009-04-29 | Paper |
| Quadruple systems with independent neighborhoods | 2008-12-08 | Paper |
| Game chromatic index of graphs with given restrictions on degrees | 2008-11-18 | Paper |
| An exact Turán result for the generalized triangle | 2008-10-21 | Paper |
| Constructions of non-principal families in extremal hypergraph theory | 2008-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517158 | 2008-08-12 | Paper |
| Odd and even cycles in maker-breaker games | 2008-04-22 | Paper |
| Characterization of product anti-magic graphs of large order | 2008-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5449159 | 2008-03-11 | Paper |
| Maximum acyclic and fragmented sets in regular graphs | 2008-02-13 | Paper |
| Generating Edge-Labeled Trees | 2008-02-05 | Paper |
| Maximum number of colorings of (2k, k2)‐graphs | 2008-01-04 | Paper |
| Decomposable graphs and definitions with no quantifier alternation | 2007-11-21 | Paper |
| Minimum \(H\)-decompositions of graphs | 2007-10-10 | Paper |
| Product rule wins a competitive game | 2007-07-27 | Paper |
| A new generalization of Mantel's theorem to \(k\)-graphs | 2007-06-08 | Paper |
| Size Ramsey Numbers and Integer Programming | 2007-05-29 | Paper |
| First-Order Definability of Trees and Sparse Random Graphs | 2007-05-15 | Paper |
| Trees are almost prime | 2007-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3425663 | 2007-03-01 | Paper |
| The first order definability of graphs: Upper bounds for quantifier depth | 2007-01-09 | Paper |
| Edge-bandwidth of grids and tori | 2007-01-09 | Paper |
| Dense edge-magic graphs and thin additive bases | 2006-09-14 | Paper |
| 4-books of three pages | 2006-08-04 | Paper |
| Bounds on the generalised acyclic chromatic numbers of bounded degree graphs | 2006-06-16 | Paper |
| Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite. | 2006-05-24 | Paper |
| Succinct definitions in the first order theory of graphs | 2006-04-28 | Paper |
| Degree sequences of \(F\)-free graphs | 2006-01-17 | Paper |
| Descriptive complexity of finite structures: Saving the quantifier rank | 2006-01-16 | Paper |
| On Triple Systems with Independent Neighbourhoods | 2005-11-14 | Paper |
| The Game of JumbleG | 2005-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463484 | 2005-08-04 | Paper |
| Integer sets with prescribed pairwise differences being distinct | 2005-05-04 | Paper |
| How complex are random graphs in first order logic? | 2005-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665534 | 2005-04-11 | Paper |
| Biased positional games on matroids | 2005-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4831471 | 2005-01-03 | Paper |
| Remarks on a paper by H. Bielak on size Ramsey numbers | 2004-09-08 | Paper |
| Optimizers for Sub-Sums subject to a Sum- and a Schur-Convex Constraint with Applications to Estimation of Eigenvalues | 2004-05-18 | Paper |
| Asymptotic Size Ramsey Results for Bipartite Graphs | 2004-01-08 | Paper |
| Further asymptotic size Ramsey results obtained via linear programming | 2004-01-05 | Paper |
| Lattice points in lattice polytopes | 2003-11-16 | Paper |
| On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets | 2003-08-21 | Paper |
| The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\) | 2003-05-07 | Paper |
| Size ramsey numbers of stars versus 4‐chromatic graphs | 2003-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4795896 | 2003-02-26 | Paper |
| Weakly saturated hypergraphs and exterior algebra | 2002-09-17 | Paper |
| Uniform families and count matroids | 2002-06-19 | Paper |
| Disjoint subgraphs of large maximum degree | 2002-05-28 | Paper |
| Size Ramsey numbers of stars versus 3-chromatic graphs | 2002-02-13 | Paper |
| Borsuk's Conjecture Fails in Dimensions 321 and 322 | 2002-02-12 | Paper |
| On Envy-Free Cake Division | 2001-11-26 | Paper |
| Constructing designs straightforwardly: Worst arising cases | 2001-10-21 | Paper |
| Remarks on a Paper by Y.Caro and R.Yuster on Turan Problem | 2001-01-29 | Paper |
| Operators Extending (Pseudo-)Metrics | 2000-12-12 | Paper |
| On edge decompositions of posets | 2000-09-04 | Paper |
| Foata's Bijection for Tree-Like Structures | 2000-07-25 | Paper |
| Asymptotic evaluation of the sat-function for \(r\)-stars | 2000-03-23 | Paper |
| The Minimum Size of Saturated Hypergraphs | 2000-01-30 | Paper |
| Extending metrics in compact pairs | 1999-11-22 | Paper |
| Enumeration of labelled \((k,m)\)-trees | 1999-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4383407 | 1998-04-01 | Paper |
| Lifting functors to Eilenberg-Moore category of monad generated by functor CpCp | 1993-08-30 | Paper |
| Lifting functors to Eilenberg-Moore category of monad generated by functor CpCp | 1992-01-01 | Paper |
| Borel version of the Local Lemma | N/A | Paper |
| Moser-Tardos Algorithm with small number of random bits | N/A | Paper |
| On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'os for $k=5,6,7$ | N/A | Paper |
