| Publication | Date of Publication | Type |
|---|
A note on the minimum size of Turán systems
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
Local version of Vizing's theorem for multigraphs
Journal of Graph Theory | 2025-01-06 | Paper |
Forcing generalised quasirandom graphs efficiently
Combinatorics, Probability and Computing | 2024-11-05 | Paper |
Sharp bounds for decomposing graphs into edges and triangles
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
On the \((6,4)\)-problem of Brown, Erdős, and Sós
Proceedings of the American Mathematical Society. Series B | 2024-06-27 | Paper |
On the limit of the positive \(\ell\)-degree Turán problem
The Electronic Journal of Combinatorics | 2024-02-23 | Paper |
Exact solutions to the Erdős-Rothschild problem
Forum of Mathematics, Sigma | 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
Journal of the London Mathematical Society | 2023-09-15 | Paper |
The codegree threshold of \(K_4^-\)
Journal of the London Mathematical Society. Second Series | 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
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Disjoint isomorphic balanced clique subdivisions
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Stability for the Erdős-Rothschild problem
Forum of Mathematics, Sigma | 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
Acta Mathematica Hungarica | 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
(available as arXiv preprint) | 2022-11-18 | Paper |
| Borel combinatorics of locally finite graphs | 2022-11-18 | Paper |
Measurable equidecompositions for group actions with an expansion property
Journal of the European Mathematical Society (JEMS) | 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
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Stability for the Erd\H{o}s-Rothschild problem
(available as arXiv preprint) | 2021-05-20 | Paper |
On a question of Vera T. S\'os about size forcing of graphons
(available as arXiv preprint) | 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
discrete Analysis | 2021-01-16 | Paper |
| Divisibility of Spheres with Measurable Pieces | 2020-12-09 | Paper |
Measurable versions of Vizing's theorem
Advances in Mathematics | 2020-10-08 | Paper |
Supersaturation problem for the bowtie
European Journal of Combinatorics | 2020-06-16 | Paper |
Isometric copies of directed trees in orientations of graphs
Journal of Graph Theory | 2020-05-21 | Paper |
Isometric copies of directed trees in orientations of graphs
Journal of Graph Theory | 2020-05-21 | Paper |
The exact minimum number of triangles in graphs with given order and size
Forum of Mathematics, Pi | 2020-05-04 | Paper |
Minimizing the number of 5-cycles in graphs with given edge-density
Combinatorics, Probability and Computing | 2020-04-06 | Paper |
Minimum number of additive tuples in groups of prime order
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Minimum number of additive tuples in groups of prime order
The Electronic Journal of Combinatorics | 2019-03-05 | Paper |
Edges not in any monochromatic copy of a fixed graph
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
Edges not in any monochromatic copy of a fixed graph
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
Strong forms of stability from flag algebra calculations
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
Strong forms of stability from flag algebra calculations
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
How unproportional must a graph be?
European Journal of Combinatorics | 2018-08-24 | Paper |
How unproportional must a graph be?
European Journal of Combinatorics | 2018-08-24 | Paper |
The codegree threshold of \(K_4^-\)
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Supersaturation problem for the bowtie
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
| The minimum number of triangles in graphs of given order and size | 2018-01-18 | Paper |
Asymptotic structure of graphs with the minimum number of triangles
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Minimum Number of Monotone Subsequences of Length 4 in Permutations
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques
Mathematical Proceedings of the Cambridge Philosophical Society | 2017-09-28 | Paper |
Measurable circle squaring
Annals of Mathematics. Second Series | 2017-04-05 | Paper |
Measurable circle squaring
Annals of Mathematics. Second Series | 2017-04-05 | Paper |
Kőnig's line coloring and Vizing's theorems for graphings
Forum of Mathematics, Sigma | 2017-04-04 | Paper |
Supersaturation problem for color-critical graphs
Journal of Combinatorial Theory. Series B | 2017-01-26 | Paper |
| Size Ramsey numbers involving large stars | 2016-07-01 | Paper |
Monochromatic clique decompositions of graphs
Journal of Graph Theory | 2016-02-01 | Paper |
Measurable equidecompositions for group actions with an expansion property
(available as arXiv preprint) | 2016-01-12 | Paper |
The maximal length of a gap between \(r\)-graph Turán densities
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
The maximal length of a gap between \(r\)-graph Turán densities
The Electronic Journal of Combinatorics | 2015-11-02 | Paper |
The codegree threshold for 3-graphs with independent neighborhoods
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
The codegree threshold for 3-graphs with independent neighborhoods
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
How to play Dundee.
(available as arXiv preprint) | 2015-08-26 | Paper |
Poset limits can be totally ordered
Transactions of the American Mathematical Society | 2015-04-22 | Paper |
Coloring \(d\)-embeddable \(k\)-uniform hypergraphs
Discrete & Computational Geometry | 2015-02-03 | Paper |
Martin Gardner’s Minimum No-3-in-a-Line Problem
American Mathematical Monthly | 2014-11-10 | Paper |
On possible Turán densities
Israel Journal of Mathematics | 2014-10-24 | Paper |
| Measurable equidecompositions via combinatorics and group theory | 2014-08-08 | Paper |
| scientific article; zbMATH DE number 6303009 (Why is no real title available?) | 2014-06-11 | Paper |
Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
Combinatorics, Probability and Computing | 2014-02-24 | Paper |
On minimum saturated matrices
Graphs and Combinatorics | 2013-09-26 | Paper |
A note on the Turán function of even cycles
Proceedings of the American Mathematical Society | 2013-09-03 | Paper |
Primality of trees
Journal of Combinatorics | 2013-07-30 | Paper |
Quasirandom permutations are characterized by 4-point densities
Geometric and Functional Analysis. GAFA | 2013-06-25 | Paper |
Exact computation of the hypergraph Turán function for expanded complete 2-graphs
Journal of Combinatorial Theory. Series B | 2013-04-17 | Paper |
The maximum number of \(K_{3}\)-free and \(K_{4}\)-free edge 4-colorings
Journal of the London Mathematical Society. Second Series | 2012-06-08 | Paper |
Logical complexity of graphs: a survey
(available as arXiv preprint) | 2012-03-02 | Paper |
Hypergraphs with independent neighborhoods
Combinatorica | 2011-12-19 | Paper |
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges
European Journal of Combinatorics | 2011-11-29 | Paper |
Flips in graphs
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
Set systems without a strong simplex
SIAM Journal on Discrete Mathematics | 2011-06-17 | Paper |
The saturation function of complete partite graphs
Journal of Combinatorics | 2011-06-14 | Paper |
Untangling planar graphs from a specified vertex position-Hard cases
Discrete Applied Mathematics | 2011-05-17 | Paper |
Maximizing the number of q -colorings
Proceedings of the London Mathematical Society | 2010-11-26 | Paper |
An analytic approach to stability
Discrete Mathematics | 2010-10-19 | Paper |
Decomposable graphs and definitions with no quantifier alternation
(available as arXiv preprint) | 2010-07-30 | Paper |
| Decomposable graphs and definitions with no quantifier alternation | 2010-07-30 | Paper |
Memoryless rules for Achlioptas processes
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Finding an unknown acyclic orientation of a given graph
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Anti-Ramsey properties of random graphs
Journal of Combinatorial Theory. Series B | 2010-04-21 | Paper |
Anti-Ramsey numbers of doubly edge-critical graphs
Journal of Graph Theory | 2009-12-18 | Paper |
The maximum size of hypergraphs without generalized 4-cycles
Journal of Combinatorial Theory. Series A | 2009-06-17 | Paper |
Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree
Graphs and Combinatorics | 2009-04-29 | Paper |
Quadruple systems with independent neighborhoods
Journal of Combinatorial Theory. Series A | 2008-12-08 | Paper |
Game chromatic index of graphs with given restrictions on degrees
Theoretical Computer Science | 2008-11-18 | Paper |
An exact Turán result for the generalized triangle
Combinatorica | 2008-10-21 | Paper |
Constructions of non-principal families in extremal hypergraph theory
Discrete Mathematics | 2008-09-04 | Paper |
| On the connectivity of extremal Ramsey graphs | 2008-08-12 | Paper |
Odd and even cycles in maker-breaker games
European Journal of Combinatorics | 2008-04-22 | Paper |
Characterization of product anti-magic graphs of large order
Graphs and Combinatorics | 2008-03-14 | Paper |
| A note on minimum \(K_{2,3}\)-saturated graphs | 2008-03-11 | Paper |
Maximum acyclic and fragmented sets in regular graphs
Journal of Graph Theory | 2008-02-13 | Paper |
Generating Edge-Labeled Trees
The American Mathematical Monthly | 2008-02-05 | Paper |
Maximum number of colorings of (2k, k2)‐graphs
Journal of Graph Theory | 2008-01-04 | Paper |
Decomposable graphs and definitions with no quantifier alternation
European Journal of Combinatorics | 2007-11-21 | Paper |
Minimum \(H\)-decompositions of graphs
Journal of Combinatorial Theory. Series B | 2007-10-10 | Paper |
Product rule wins a competitive game
Proceedings of the American Mathematical Society | 2007-07-27 | Paper |
A new generalization of Mantel's theorem to \(k\)-graphs
Journal of Combinatorial Theory. Series B | 2007-06-08 | Paper |
Size Ramsey Numbers and Integer Programming
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
First-Order Definability of Trees and Sparse Random Graphs
Combinatorics, Probability and Computing | 2007-05-15 | Paper |
Trees are almost prime
Discrete Mathematics | 2007-04-26 | Paper |
| scientific article; zbMATH DE number 5130028 (Why is no real title available?) | 2007-03-01 | Paper |
The first order definability of graphs: Upper bounds for quantifier depth
Discrete Applied Mathematics | 2007-01-09 | Paper |
Edge-bandwidth of grids and tori
Theoretical Computer Science | 2007-01-09 | Paper |
Dense edge-magic graphs and thin additive bases
Discrete Mathematics | 2006-09-14 | Paper |
4-books of three pages
Journal of Combinatorial Theory. Series A | 2006-08-04 | Paper |
Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
Graphs and Combinatorics | 2006-06-16 | Paper |
Maximum \(K_{r+1}\)-free graphs which are not \(r\)-partite.
Matematychni Studiï | 2006-05-24 | Paper |
Succinct definitions in the first order theory of graphs
Annals of Pure and Applied Logic | 2006-04-28 | Paper |
Degree sequences of \(F\)-free graphs
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Degree sequences of \(F\)-free graphs
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Descriptive complexity of finite structures: Saving the quantifier rank
Journal of Symbolic Logic | 2006-01-16 | Paper |
On Triple Systems with Independent Neighbourhoods
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
The Game of JumbleG
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
| scientific article; zbMATH DE number 2192110 (Why is no real title available?) | 2005-08-04 | Paper |
Integer sets with prescribed pairwise differences being distinct
European Journal of Combinatorics | 2005-05-04 | Paper |
How complex are random graphs in first order logic?
Random Structures & Algorithms | 2005-04-21 | Paper |
| scientific article; zbMATH DE number 2154963 (Why is no real title available?) | 2005-04-11 | Paper |
Biased positional games on matroids
European Journal of Combinatorics | 2005-02-23 | Paper |
| scientific article; zbMATH DE number 2124072 (Why is no real title available?) | 2005-01-03 | Paper |
Remarks on a paper by H. Bielak on size Ramsey numbers
Periodica Mathematica Hungarica | 2004-09-08 | Paper |
Optimizers for Sub-Sums subject to a Sum- and a Schur-Convex Constraint with Applications to Estimation of Eigenvalues
Mathematical Inequalities & Applications | 2004-05-18 | Paper |
Asymptotic Size Ramsey Results for Bipartite Graphs
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Further asymptotic size Ramsey results obtained via linear programming
Discrete Mathematics | 2004-01-05 | Paper |
Lattice points in lattice polytopes
Mathematika | 2003-11-16 | Paper |
On the cofinality of infinite partially ordered sets: Factoring a poset into lean essential subsets
Order | 2003-08-21 | Paper |
The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)
The Electronic Journal of Combinatorics | 2003-05-07 | Paper |
Size ramsey numbers of stars versus 4‐chromatic graphs
Journal of Graph Theory | 2003-04-03 | Paper |
| scientific article; zbMATH DE number 1874445 (Why is no real title available?) | 2003-02-26 | Paper |
Weakly saturated hypergraphs and exterior algebra
Combinatorics, Probability and Computing | 2002-09-17 | Paper |
Uniform families and count matroids
Graphs and Combinatorics | 2002-06-19 | Paper |
Disjoint subgraphs of large maximum degree
Discrete Mathematics | 2002-05-28 | Paper |
Size Ramsey numbers of stars versus 3-chromatic graphs
Combinatorica | 2002-02-13 | Paper |
| Borsuk's Conjecture Fails in Dimensions 321 and 322 | 2002-02-12 | Paper |
On Envy-Free Cake Division
American Mathematical Monthly | 2001-11-26 | Paper |
Constructing designs straightforwardly: Worst arising cases
Journal of Combinatorial Designs | 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
Order | 2000-09-04 | Paper |
| Foata's Bijection for Tree-Like Structures | 2000-07-25 | Paper |
Asymptotic evaluation of the sat-function for \(r\)-stars
Discrete Mathematics | 2000-03-23 | Paper |
The Minimum Size of Saturated Hypergraphs
Combinatorics, Probability and Computing | 2000-01-30 | Paper |
Extending metrics in compact pairs
Matematychni Studiï | 1999-11-22 | Paper |
Enumeration of labelled \((k,m)\)-trees
Journal of Combinatorial Theory. Series A | 1999-08-19 | Paper |
| scientific article; zbMATH DE number 1138033 (Why is no real title available?) | 1998-04-01 | Paper |
Lifting functors to Eilenberg-Moore category of monad generated by functor CpCp
Ukrainian Mathematical Journal | 1993-08-30 | Paper |
Lifting functors to Eilenberg-Moore category of monad generated by functor CpCp
Ukrainian Mathematical Journal | 1992-01-01 | Paper |
Borel version of the Local Lemma
(available as arXiv preprint) | N/A | Paper |
Moser-Tardos Algorithm with small number of random bits
(available as arXiv preprint) | N/A | Paper |
On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'os for $k=5,6,7$
(available as arXiv preprint) | N/A | Paper |
