Nearly optimal distributed edge colouring in O(log log n) rounds
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Random graphs, random triangle-free graphs, and random partial orders
Computational Discrete Mathematics
Three-colourbility and forbidden subgraphs. II: polynomial algorithms
Discrete Mathematics
Concentration of non-Lipschitz functions and applications
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Triangle-free graphs and forbidden subgraphs
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Ramsey numbers involving large dense graphs and bipartite Turán numbers
Journal of Combinatorial Theory Series B
A few remarks on Ramsey--Turán-type problems
Journal of Combinatorial Theory Series B
Turán's theorem in sparse random graphs
Random Structures & Algorithms
On the Minimum Number of k-Cliques in Graphs with Restricted Independence Number
Combinatorics, Probability and Computing
A Selection of Problems and Results in Combinatorics
Combinatorics, Probability and Computing
A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
Combinatorics, Probability and Computing
Independence numbers of hypergraphs with sparse neighborhoods
European Journal of Combinatorics
Some remarks on Hajós' conjecture
Journal of Combinatorial Theory Series B
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
Journal of Combinatorial Theory Series B
Note: Bounds on some van der Waerden numbers
Journal of Combinatorial Theory Series A
Some constructive bounds on Ramsey numbers
Journal of Combinatorial Theory Series B
Claw-free graphs VI. Colouring
Journal of Combinatorial Theory Series B
| Hi-index | 0.00 |