|
|
2016-present
-
The digraph drop polynomial, in Connections in Discrete Mathematics,
(S. Butler, J. Cooper, G. Hurlbert, eds.) Cambridge University Press, 2018, 86-103,
(with Ron Graham)
-
Sum
sequences modulo n, JCT(A), 158, (2018), 290--314,
(with Jon Folkman and Ron Graham)
2011-2015
2006-2010
Back to top
-
Universal juggling cycles,
Integers,
Combinatorial Number Theory, B.
Landman, M.B. Nathanson, J. Nesetril, R.J. Nowakowski, C. Pomerance, eds.
(2007), 121-130. Also appeared in INTEGERS 7(2) (2007), A8 (electronic) 10
pp.
(with Ron Graham).
2001-2005
Back to top
1996-2000
Back to top
1991-1995
Back to top
1986-1990
Back to top
-
Quasi-random classes of hypergraphs,
Random Structures and Algorithms 1 (1990), 363--382.
Corrigendum.
-
On graphs not containing prescribed induced subgraphs,
in A Tribute to Paul Erdos, Cambridge University Press (1990), 111--120,
(with R.L. Graham).
-
Universal graphs and induced-universal graphs,
J. Graph Theory 14 (1990) 443--454.
-
Universal graphs for
bounded-degree trees and planar graphs,
SIAM J. Discrete Math. 2 (1989), 145--155,
(with S. Bhatt, F. T. Leighton and A. L. Rosenberg).
1981-1985
Back to top
-
On universal graphs for spanning trees,
Journal of London Math. Soc. 27 (1983), 203--211
(with R. L. Graham).
-
On complete bipartite subgraphs contained in
spanning tree complements,
Studies in Pure Mathematics, (ed.-in-chief P. Erdös) Akadémiai Kiadó, Budapest, (1983)
83--90,
(with B. Bollobas and R. L. Graham).
-
Minimal decompositions of hypergraphs into mutually
isomorphic subhypergraphs,
J. Comb. Th. (A) 32 (1982), 241--251,
(with P. Erdös and R. L. Graham).
-
On graphs which contain all sparse graphs,
Annals of Discrete Math. 12 (1982), 21--26,
(with L. Babai, P. Erdös, R. L. Graham, and J. Spencer).
-
Minimal decomposition of all graphs
with equinumerous vertices and edges into mutually isomorphic subgraphs,
Finite and infinite sets, Vol. I, II (Eger, 1981), 171--179, Colloq. Math.
Soc. János Bolyai 37, North-Holland, Amsterdam, 1984,
(with P. Erdös and R. L. Graham).
-
Recent results in graph decompositions,
Combinatorics (Swansea, 1981), pp. 103--123, London Math. Soc. Lecture Note Ser. 52,
Cambridge Univ. Press, Cambridge-New York, 1981,
(with R. L. Graham).
-
Universal caterpillars,
J. Comb. Th. (B) 31 (1981), 348--355,
(with R. L. Graham and J. Shearer).
-
On trees containing all small trees,
The Theory of Applications of Graphs (ed. by G. Chartrand) John Wiley and
Sons, (1981) 265--272,
(with R. L. Graham and D. Coppersmith).
-
Minimal decomposition of graphs into mutually
isomorphic subgraphs,
Combinatorica 1 (1981), 13--24,
(with P. Erdös and R. L. Graham).
-
On the decompositions of graphs,
SIAM J. Alg. Disc. Methods 2 (1981), 1--12.
1975-1980
Back to top
-
On universal graphs,
Annals of the New York Academy of Sciences 319 (1979), 136--140,
(with R. L. Graham).
-
Minimal decompositions of two graphs into pairwise isomorphic subgraphs,
Proceedings of the 10th Southeastern Conf. on Comb., Graph Theory and Computing (1979), 3--18,
(with P. Erdos, R.L. Graham, S.M. Ulam and F.F. Yao).
-
On graphs which contain all small trees,
J. Comb. Th. (B) 24 (1978), 14--23,
(with R. L. Graham).
-
On graphs which contain all small trees II,
Colloquia Mathematica Societatis János Bolyai, Keszthely, Hungary, (1976), 213--223,
(with R. L. Graham and N. Pippenger).
1973-1975
Back to top
|