2024
On the restricted size Ramsey number for a pair of cycles.
Discret. Math., April, 2024
2023
The Ramsey number of a long even cycle versus a star.
J. Comb. Theory B, 2023
2022
Long monochromatic even cycles in 3-edge-coloured graphs of large minimum degree.
J. Graph Theory, 2022
On the Ramsey-Turán Density of Triangles.
Comb., 2022
2021
Andrásfai and Vega graphs in Ramsey-Turán theory.
J. Graph Theory, 2021
2020
On Schelp's problem for three odd long cycles.
J. Comb. Theory B, 2020
2019
Paths in Hypergraphs: A Rescaling Phenomenon.
SIAM J. Discret. Math., 2019
Asymmetry and structural information in preferential attachment graphs.
Random Struct. Algorithms, 2019
Compression of Preferential Attachment Graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
A tale of stars and cliques.
J. Comb. Theory A, 2018
On multicolor Ramsey numbers for loose k-paths of length three.
Eur. J. Comb., 2018
The multipartite Ramsey number for the 3-path of length three.
Discret. Math., 2018
On the diameter of Kronecker graphs.
Discret. Math., 2018
Integral Homology of Random Simplicial Complexes.
Discret. Comput. Geom., 2018
Anagram-Free Colourings of Graphs.
Comb. Probab. Comput., 2018
The Ramsey Numbers for A Triple of Long Cycles.
Comb., 2018
2017
Anagram-free colorings of graphs.
Electron. Notes Discret. Math., 2017
On the Multicolor Ramsey Number for 3-Paths of Length Three.
Electron. J. Comb., 2017
2016
Highly connected monochromatic subgraphs of two-colored complete graphs.
J. Comb. Theory B, 2016
Picker-Chooser fixed graph games.
J. Comb. Theory B, 2016
Manipulative Waiters with Probabilistic Intuition.
Comb. Probab. Comput., 2016
2015
Hamilton cycles in random lifts of graphs.
Eur. J. Comb., 2015
Randomly generated groups.
Proceedings of the Surveys in Combinatorics 2015, 2015
2014
On Erdős' extremal problem on matchings in hypergraphs.
J. Comb. Theory A, 2014
2013
Limit measures of inhomogeneous discrete-time quantum walks in one dimension.
Quantum Inf. Process., 2013
Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes.
Discret. Comput. Geom., 2013
Dense Difference Sets and Their Combinatorial Structure.
Proceedings of the Mathematics of Paul Erdős I, 2013
2012
On the multi-colored Ramsey numbers of cycles.
J. Graph Theory, 2012
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges.
Comb. Probab. Comput., 2012
On Even-Degree Subgraphs of Linear Hypergraphs.
Comb. Probab. Comput., 2012
Monochromatic Cycles in 2-Coloured Graphs.
Comb. Probab. Comput., 2012
On Matchings in Hypergraphs.
Electron. J. Comb., 2012
2010
Chasing robbers on random graphs: Zigzag theorem.
Random Struct. Algorithms, 2010
Comb. Probab. Comput., 2010
2009
The critical behavior of random digraphs.
Random Struct. Algorithms, 2009
Critical graphs for subpancyclicity of 3-connected claw-free graphs.
J. Graph Theory, 2009
The Ramsey Number for 3-Uniform Tight Hypergraph Cycles.
Comb. Probab. Comput., 2009
2008
Electron. Notes Discret. Math., 2008
On the minimum degree forcing F-free graphs to be (nearly) bipartite.
Discret. Math., 2008
Self-stabilizing population of mobile agents.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008
2007
The Ramsey number for a triple of long even cycles.
J. Comb. Theory B, 2007
First-Order Definability of Trees and Sparse Random Graphs.
Comb. Probab. Comput., 2007
2006
A Probabilistic Approach to the Dichotomy Problem.
SIAM J. Comput., 2006
The phase transition in the cluster-scaled model of a random graph.
Random Struct. Algorithms, 2006
The connectivity threshold for the min-degree random graph process.
Random Struct. Algorithms, 2006
The Ramsey number for hypergraph cycles I.
J. Comb. Theory A, 2006
When is a random graph projective?
Eur. J. Comb., 2006
Constructive Upper Bounds for Cycle-Saturated Graphs of Minimum Size.
Electron. J. Comb., 2006
On The Structure Of Triangle-Free Graphs Of Large Minimum Degree.
Comb., 2006
2005
Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings.
J. Discrete Algorithms, 2005
2004
Claw-free 3-connected <i>P</i><sub>11</sub>-free graphs are hamiltonian.
J. Graph Theory, 2004
Note on projective graphs.
J. Graph Theory, 2004
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs.
J. Graph Theory, 2004
Proceedings of the Information Security and Cryptology, 2004
2002
On the discrepancy of combinatorial rectangles.
Random Struct. Algorithms, 2002
Vertex Ramsey Properties of Families of Graphs.
J. Comb. Theory B, 2002
Ramsey Properties of Families of Graphs.
J. Comb. Theory B, 2002
On induced Ramsey numbers.
Discret. Math., 2002
Ramsey Numbers for Trees of Small Maximum Degree.
Comb., 2002
2001
Biased positional games and the phase transition.
Random Struct. Algorithms, 2001
Sum-Free Subsets of Right Cancellative Semigroups.
Eur. J. Comb., 2001
On minimal Folkman graphs.
Discret. Math., 2001
2000
On triangle-free random graphs.
Random Struct. Algorithms, 2000
Embedding trees into graphs of large girth.
Discret. Math., 2000
Biased Positional Games for Which Random Strategies are Nearly Optimal.
Comb., 2000
Wiley-Interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-0-471-17541-4, 2000
1999
R(C<sub>n</sub>, C<sub>n</sub>, C<sub>n</sub>)<=(4+o(1)) n.
J. Comb. Theory B, 1999
On the connectivity of random subsets of projective spaces.
Discret. Math., 1999
1998
A Greedy Algorithm Estimating the Height of Random Trees.
SIAM J. Discret. Math., 1998
Random trees and random graphs.
Random Struct. Algorithms, 1998
Independent finite sums in graphs defined on the natural numbers.
Discret. Math., 1998
Partitioning Two-Coloured Complete Graphs into Two Monochromatic Cycles.
Comb. Probab. Comput., 1998
Endomorphisms of Partially Ordered Sets.
Comb. Probab. Comput., 1998
1997
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'.
IEEE Trans. Inf. Theory, 1997
A suboptimal lossy data compression based on approximate pattern matching.
IEEE Trans. Inf. Theory, 1997
Convergence of probabilities for the second order monadic properties of a random mapping.
Random Struct. Algorithms, 1997
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph.
J. Algorithms, 1997
The number of connected sparsely edged uniform hypergraphs.
Discret. Math., 1997
Graphs without short odd cycles are nearly bipartite.
Discret. Math., 1997
On <i>K</i><sup>4</sup>-Free Subgraphs of Random Graphs.
Comb., 1997
On the minimum number of edges giving maximum oriented chromatic number.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997
1996
Ramsey-type results for oriented trees.
J. Graph Theory, 1996
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree.
J. Comb. Theory B, 1996
On the evolution of a random tournament.
Discret. Math., 1996
Graphs in which each C<sub>4</sub> spans K<sub>4</sub>.
Discret. Math., 1996
Turán's Extremal Problem in Random Graphs: Forbidding ODD Cycles.
Comb., 1996
1995
Convergence in Homogeneous Random Graphs.
Random Struct. Algorithms, 1995
Connectivity Properties of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1995
A Note on the Density of Sum-free Sets.
J. Comb. Theory A, 1995
Sparse Anti-Ramsey Graphs.
J. Comb. Theory B, 1995
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
J. Comb. Theory B, 1995
The Induced Size-Ramsey Number of Cycles.
Comb. Probab. Comput., 1995
1994
Random Struct. Algorithms, 1994
Change of Leadership in a Random Graph Process.
Random Struct. Algorithms, 1994
On the Diameter and Radius of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1994
Phase transition phenomena in random discrete structures.
Discret. Math., 1994
On the k-diameter of k-regular k-connected graphs.
Discret. Math., 1994
Independet Transversals in Sparse Partite Hypergraphs.
Comb. Probab. Comput., 1994
On Ramsey Minimal Graphs.
Electron. J. Comb., 1994
A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms.
Proceedings of the Combinatorial Pattern Matching, 5th Annual Symposium, 1994
1993
The Birth of the Giant Component.
Random Struct. Algorithms, 1993
The size of the largest hole in a random graph.
Discret. Math., 1993
On Random Generation of the Symmetic Group.
Comb. Probab. Comput., 1993
Approximations with Axis-Aligned Rectangles (Extended Abstract).
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
1992
The Evaluation of Random Subgraphs of the Cube.
Random Struct. Algorithms, 1992
Ramsey properties of random graphs.
J. Comb. Theory B, 1992
On the independence and chromatic numbers of random regular graphs.
J. Comb. Theory B, 1992
Componenets of Random Forests.
Comb. Probab. Comput., 1992
Cycles in a Uniform Graph Process.
Comb. Probab. Comput., 1992
1991
Tree-Matchings in Graph Processes.
SIAM J. Discret. Math., 1991
Stability of Vertices in Random Boolean Cellular Automata.
Random Struct. Algorithms, 1991
Cycles in a Random Graph Near the Critical Point.
Random Struct. Algorithms, 1991
How to deal with unlabeled random graphs.
J. Graph Theory, 1991
Size and connectivity of the k-core of a random graph.
Discret. Math., 1991
Discret. Appl. Math., 1991
A note on the sharp concentration of the chromatic number of random graphs.
Comb., 1991
The chromatic number of random graphs.
Comb., 1991
1990
Component Behavior Near the Critical Point of the Random Graph Process.
Random Struct. Algorithms, 1990
On the Number of Sparse Connected Graphs.
Random Struct. Algorithms, 1990
The phase transition in the evolution of random digraphs.
J. Graph Theory, 1990
1989
The chromatic number of random graphs at the double jump threshold.
Comb., 1989
1988
On <i>k</i>-leaf connectivity of a random graph.
J. Graph Theory, 1988
Maximal induced trees in sparse random graphs.
Discret. Math., 1988
