| Publication | Date of Publication | Type |
|---|
Path Saturation Game on Six Vertices
Graphs and Combinatorics | 2024-04-21 | Paper |
The structure and number of Erdős covering systems
Journal of the European Mathematical Society (JEMS) | 2024-03-11 | Paper |
Subcritical monotone cellular automata
Random Structures & Algorithms | 2024-01-05 | Paper |
Counting partitions of Gn,1/2$$ {G}_{n,1/2} $$ with degree congruence conditions
Random Structures & Algorithms | 2023-10-19 | Paper |
Random Translates in Minkowski Sums
| 2023-08-31 | Paper |
Counting graphic sequences via integrated random walks
| 2023-01-17 | Paper |
Erd\H{o}s covering systems
| 2022-11-02 | Paper |
Improved bounds for 1-independent percolation on $\mathbb{Z}^n$
| 2022-06-24 | Paper |
Universality for monotone cellular automata
| 2022-03-25 | Paper |
The critical length for growing a droplet
| 2022-03-25 | Paper |
On the Erdős covering problem: the density of the uncovered set
Inventiones Mathematicae | 2022-03-22 | Paper |
A Note on Infinite Antichain Density
SIAM Journal on Discrete Mathematics | 2022-03-15 | Paper |
The Erdős-Selfridge problem with square-free moduli
Algebra & Number Theory | 2021-05-27 | Paper |
Erdős covering systems
Acta Mathematica Hungarica | 2021-01-25 | Paper |
Flat Littlewood polynomials exist
Annals of Mathematics. Second Series | 2020-12-14 | Paper |
Covering intervals with arithmetic progressions
Acta Mathematica Hungarica | 2020-10-02 | Paper |
Bounds on Rudin-Shapiro polynomials of arbitrary degree
| 2019-09-18 | Paper |
The asymptotic number of prefix normal words
Theoretical Computer Science | 2019-08-13 | Paper |
River landscapes and optimal channel networks
Proceedings of the National Academy of Sciences | 2019-07-03 | Paper |
Dense subgraphs in random graphs
Discrete Applied Mathematics | 2019-05-03 | Paper |
A note on Linnik's theorem on quadratic non-residues
Archiv der Mathematik | 2019-03-27 | Paper |
The Erd\H{o}s-Selfridge problem with square-free moduli
| 2019-01-31 | Paper |
Coalescence on the real line
Transactions of the American Mathematical Society | 2019-01-09 | Paper |
On the edge spectrum of saturated graphs for paths and stars
Journal of Graph Theory | 2019-01-03 | Paper |
On the Erd\H{o}s Covering Problem: the density of the uncovered set
| 2018-11-08 | Paper |
Line percolation
Random Structures & Algorithms | 2018-09-05 | Paper |
Random geometric graphs and isometries of normed spaces
Transactions of the American Mathematical Society | 2018-08-15 | Paper |
The sharp threshold for making squares
Annals of Mathematics. Second Series | 2018-06-19 | Paper |
Decompositions of graphs into cycles with chords
Journal of Combinatorial Theory. Series B | 2017-11-28 | Paper |
Catching a fast robber on the grid
Journal of Combinatorial Theory. Series A | 2017-09-05 | Paper |
Reconstructing random jigsaws
| 2017-07-15 | Paper |
Adversarial resilience of matchings in bipartite random graphs
Journal of Combinatorics | 2017-01-10 | Paper |
Controllability and matchings in random bipartite graphs
Surveys in Combinatorics 2015 | 2016-12-20 | Paper |
Barrier coverage
Random Structures & Algorithms | 2016-11-09 | Paper |
The time of bootstrap percolation in two dimensions
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2016-10-21 | Paper |
Subtended angles
Israel Journal of Mathematics | 2016-09-15 | Paper |
Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs
European Journal of Combinatorics | 2016-06-20 | Paper |
Random hypergraph irregularity
SIAM Journal on Discrete Mathematics | 2016-04-04 | Paper |
Subcritical \(\mathcal{U}\)-bootstrap percolation models have non-trivial phase transitions
Transactions of the American Mathematical Society | 2016-03-23 | Paper |
Consistent random vertex-orderings of graphs
| 2015-06-10 | Paper |
Limited packings of closed neighbourhoods in graphs
| 2015-01-08 | Paper |
Minimal Symmetric Differences of Lines in Projective Planes
Journal of Combinatorial Designs | 2014-11-26 | Paper |
Random union-closed families
| 2014-08-12 | Paper |
Interference percolation
Random Structures & Algorithms | 2014-08-07 | Paper |
Essential enhancements revisited
| 2014-02-04 | Paper |
Repeated Degrees in Random Uniform Hypergraphs
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
A concentration function estimate and intersective sets from matrices
Israel Journal of Mathematics | 2012-11-13 | Paper |
Projections, entropy and sumsets
Combinatorica | 2012-09-17 | Paper |
Critical probabilities of 1-independent percolation models
Combinatorics, Probability and Computing | 2012-05-14 | Paper |
Random partial orders defined by angular domains
Order | 2011-08-16 | Paper |
Connectivity of random addable graphs
| 2011-07-06 | Paper |
Coloring vertices and edges of a graph by nonempty subsets of a set
European Journal of Combinatorics | 2011-04-08 | Paper |
Random majority percolation
Random Structures & Algorithms | 2010-11-10 | Paper |
Bond percolation with attenuation in high dimensional Voronoĭ tilings
Random Structures & Algorithms | 2010-11-10 | Paper |
Sentry selection in wireless networks
Advances in Applied Probability | 2010-06-07 | Paper |
The Linus sequence
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
Algorithms for generating convex sets in acyclic digraphs
Journal of Discrete Algorithms | 2009-12-10 | Paper |
The Erdős–Heilbronn problem for finite groups
Acta Arithmetica | 2009-12-08 | Paper |
Sequences with Changing Dependencies
SIAM Journal on Discrete Mathematics | 2009-08-20 | Paper |
Random transceiver networks
Advances in Applied Probability | 2009-07-22 | Paper |
A critical constant for the k nearest-neighbour model
Advances in Applied Probability | 2009-05-06 | Paper |
Convex sets in acyclic digraphs
Order | 2009-05-04 | Paper |
Highly connected random geometric graphs
Discrete Applied Mathematics | 2009-03-04 | Paper |
Connected graphs without long paths
Discrete Mathematics | 2008-09-04 | Paper |
Connectivity of addable graph classes
Journal of Combinatorial Theory. Series B | 2008-04-28 | Paper |
Adjacent Vertex Distinguishing Edge‐Colorings
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
The generalized Randić index of trees
Journal of Graph Theory | 2008-01-04 | Paper |
Counting regions with bounded surface area
Communications in Mathematical Physics | 2007-10-10 | Paper |
Phase transitions in the neuropercolation model of neural populations with mixed local and non-local interactions
Biological Cybernetics | 2007-06-13 | Paper |
Large deviations for mean field models of probabilistic cellular automata
Random Structures & Algorithms | 2007-02-07 | Paper |
Ramsey unsaturated and saturated graphs
Journal of Graph Theory | 2006-03-24 | Paper |
Pair dominating graphs
European Journal of Combinatorics | 2006-03-22 | Paper |
Mono-multi bipartite Ramsey numbers, designs, and matrices
Journal of Combinatorial Theory. Series A | 2006-03-16 | Paper |
Continuum percolation with steps in the square or the disc
Random Structures & Algorithms | 2005-08-29 | Paper |
Neuropercolation: A Random Cellular Automata Approach to Spatio-temporal Neurodynamics
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Percolation in Voronoi tilings
Random Structures & Algorithms | 2005-06-01 | Paper |
Connectivity of random k-nearest-neighbour graphs
Advances in Applied Probability | 2005-05-03 | Paper |
Continuum percolation with steps in an annulus
The Annals of Applied Probability | 2005-03-21 | Paper |
Longest Paths in Circular Arc Graphs
Combinatorics, Probability and Computing | 2004-09-24 | Paper |
Balanced edge colorings.
Journal of Combinatorial Theory. Series B | 2004-03-15 | Paper |
Entropy along convex shapes, random tilings and shifts of finite type
Illinois Journal of Mathematics | 2003-11-25 | Paper |
Packing closed trails into dense graphs.
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Graphs with large maximum degree containing no odd cycles of a given length
Journal of Combinatorial Theory. Series B | 2003-08-25 | Paper |
Packing Digraphs with Directed Closed Trails
Combinatorics, Probability and Computing | 2003-07-15 | Paper |
The interlace polynomial of graphs at \(-1\)
European Journal of Combinatorics | 2003-03-18 | Paper |
Zero-sum square matrices
European Journal of Combinatorics | 2003-03-18 | Paper |
Vertex-distinguishing edge colorings of graphs
Journal of Graph Theory | 2003-03-10 | Paper |
Vertex distinguishing colorings of graphs with \(\Delta(G)=2\)
Discrete Mathematics | 2002-08-29 | Paper |
A note on Ramsey size-linear graphs
Journal of Graph Theory | 2002-08-25 | Paper |
Vertex‐distinguishing edge colorings of random graphs
Random Structures & Algorithms | 2002-06-05 | Paper |
Packing circuits into \(K_N\).
Combinatorics, Probability and Computing | 2002-03-13 | Paper |
On the Alspach conjecture
Combinatorics, Probability and Computing | 2002-02-21 | Paper |
Dependent percolation in two dimensions
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete | 2001-03-20 | Paper |
scientific article; zbMATH DE number 1380617 (Why is no real title available?)
| 1999-12-19 | Paper |
Note on Nakayama's lemma for compact \(\Lambda\)-modules
The Asian Journal of Mathematics | 1998-06-21 | Paper |
Improved upper bounds for the critical probability of oriented percolation in two dimensions
Random Structures & Algorithms | 1995-02-22 | Paper |
Upper bounds for the critical probability of oriented percolation in two dimensions
Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences | 1994-03-14 | Paper |
Reconstruction of shredded random matrices
| N/A | Paper |
