Professor of Combinatorial Mathematics
Research Interests: Combinatorics, graph theory, algorithms
Publications
An extremal function for the achromatic
number
– Contemporary Mathematics
(1993)
147,
161
On testing the ‘pseudo-randomness’ of a hypergraph
– Discrete Mathematics
(1992)
103,
321
(doi: 10.1016/0012-365X(92)90324-9)
Rotation numbers for complete tripartite graphs
– Graphs and Combinatorics
(1991)
7,
153
(doi: 10.1007/bf01788140)
A simple linear expected time algorithm for finding a hamilton path
– Discrete Mathematics
(1989)
75,
373
(doi: 10.1016/0012-365x(89)90100-3)
Dense Expanders and Pseudo-Random Bipartite Graphs
– Annals of Discrete Mathematics
(1989)
43,
381
A disproof of a conjecture of Erdös in ramsey theory
– Journal of the London Mathematical Society
(1989)
39,
246
Dense expanders and pseudo-random bipartite graphs
– Discrete Mathematics
(1989)
75,
381
(doi: 10.1016/0012-365x(89)90101-5)
A graph property not satisfying a zero-one law
– European Journal of Combinatorics
(1988)
9,
517
- <
- 8 of 10