Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Beck, József
1981.
Roth’s estimate of the discrepancy of integer sequences is nearly sharp.
Combinatorica,
Vol. 1,
Issue. 4,
p.
319.
Blass, Andreas
Exoo, Geoffrey
and
Harary, Frank
1981.
Paley graphs satisfy all first‐order adjacency axioms.
Journal of Graph Theory,
Vol. 5,
Issue. 4,
p.
435.
Lagarias, J.C
Odlyzko, A.M
and
Shearer, J.B
1982.
On the density of sequences of integers the sum of no two of which is a square. I. Arithmetic progressions.
Journal of Combinatorial Theory, Series A,
Vol. 33,
Issue. 2,
p.
167.
Alon, Noga
1984.
A note on subdigraphs of digraphs with large outdegrees.
Discrete Mathematics,
Vol. 49,
Issue. 3,
p.
321.
Pouzet, M.
1985.
Graphs and Order.
p.
592.
Spencer, Joel
1985.
Probabilistic methods.
Graphs and Combinatorics,
Vol. 1,
Issue. 1,
p.
357.
Megiddo, Nimrod
and
Vishkin, Uzi
1988.
On finding a minimum dominating set in a tournament.
Theoretical Computer Science,
Vol. 61,
Issue. 2-3,
p.
307.
Frankl, P
Rödl, V
and
Wilson, R.M
1988.
The number of submatrices of a given type in a Hadamard matrix and related results.
Journal of Combinatorial Theory, Series B,
Vol. 44,
Issue. 3,
p.
317.
Chung, F. R. K.
Graham, R. L.
and
Wilson, R. M.
1989.
Quasi-random graphs.
Combinatorica,
Vol. 9,
Issue. 4,
p.
345.
Algor, I.
and
Alon, N.
1989.
The star arboricity of graphs.
Discrete Mathematics,
Vol. 75,
Issue. 1-3,
p.
11.
Alon, Noga
1990.
Transversal numbers of uniform hypergraphs.
Graphs and Combinatorics,
Vol. 6,
Issue. 1,
p.
1.
Chung, Fan R. K.
1990.
Quasi‐random classes of hypergraphs.
Random Structures & Algorithms,
Vol. 1,
Issue. 4,
p.
363.
Chung, F. R. K.
and
Graham, R. L.
1990.
Quasi‐random hypergraphs.
Random Structures & Algorithms,
Vol. 1,
Issue. 1,
p.
105.
Hirschfeld, J.W.P.
and
Szönyi, T.
1991.
Constructions of Large Arcs and Blocking Sets in Finite Planes.
European Journal of Combinatorics,
Vol. 12,
Issue. 6,
p.
499.
Chung, F. R. K.
and
Graham, R. L.
1991.
Quasi-random set systems.
Journal of the American Mathematical Society,
Vol. 4,
Issue. 1,
p.
151.
Chung, F. R. K.
and
Graham, R. L.
1991.
Quasi‐random tournaments.
Journal of Graph Theory,
Vol. 15,
Issue. 2,
p.
173.
Chung, F.R.K.
and
Graham, R.L.
1992.
Quasi-random subsets of Zn.
Journal of Combinatorial Theory, Series A,
Vol. 61,
Issue. 1,
p.
64.
Franek, F.
and
Rödl, V.
1992.
Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs.
Graphs and Combinatorics,
Vol. 8,
Issue. 4,
p.
299.
Szőnyi, Tamás
1992.
Note on the existence of large minimal blocking sets in galois planes.
Combinatorica,
Vol. 12,
Issue. 2,
p.
227.
Israeli, Amos
and
Li, Ming
1993.
Bounded time-stamps.
Distributed Computing,
Vol. 6,
Issue. 4,
p.
205.