Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Haynsworth, Emilie
and
Hoffman, A.J.
1969.
Two remarks on compositive matrices.
Linear Algebra and its Applications,
Vol. 2,
Issue. 4,
p.
387.
Brown, W.G
Erdös, P
and
Simonovits, M
1973.
Extremal problems for directed graphs.
Journal of Combinatorial Theory, Series B,
Vol. 15,
Issue. 1,
p.
77.
Hoffman, Alan J
and
Pereira, Francisco
1973.
On copositive matrices with −1, 0, 1 entries.
Journal of Combinatorial Theory, Series A,
Vol. 14,
Issue. 3,
p.
302.
Waller, Derek A.
1977.
Optimisation of quadratic forms associated with graphs.
Glasgow Mathematical Journal,
Vol. 18,
Issue. 1,
p.
79.
Sós, Vera T
and
Straus, E.G
1982.
Extremals of functions on graphs with applications to graphs and hypergraphs.
Journal of Combinatorial Theory, Series B,
Vol. 32,
Issue. 3,
p.
246.
Hadeler, K.P.
1983.
On copositive matrices.
Linear Algebra and its Applications,
Vol. 49,
Issue. ,
p.
79.
BROWN, W.G.
ERDÖS, P.
and
SIMONOVITS, M.
1984.
Finite and Infinite Sets.
p.
119.
Brown, W.G
and
Simonovits, M
1984.
Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures.
Discrete Mathematics,
Vol. 48,
Issue. 2-3,
p.
147.
Brown, W. G.
Erdős, P.
and
Simonovits, M.
1985.
Algorithmic solution of extremal digraph problems.
Transactions of the American Mathematical Society,
Vol. 292,
Issue. 2,
p.
421.
Goldberg, Moshe
1985.
Ernst G. Straus (1922–1983).
Linear Algebra and its Applications,
Vol. 64,
Issue. ,
p.
1.
Wilf, Herbert S
1986.
Spectral bounds for the clique and independence numbers of graphs.
Journal of Combinatorial Theory, Series B,
Vol. 40,
Issue. 1,
p.
113.
Sidorenko, A. F.
1987.
The maximal number of edges in a homogeneous hypergraph containing no prohibited subgraphs.
Mathematical Notes of the Academy of Sciences of the USSR,
Vol. 41,
Issue. 3,
p.
247.
Aharoni, R.
Erdős, P.
and
Linial, N.
1988.
Optima of dual integer linear programs.
Combinatorica,
Vol. 8,
Issue. 1,
p.
13.
Füredi, Zoltán
1988.
Matchings and covers in hypergraphs.
Graphs and Combinatorics,
Vol. 4,
Issue. 1,
p.
115.
Sidorenko, A. F.
1989.
Asymptotic solution for a new class of forbiddenr-graphs.
Combinatorica,
Vol. 9,
Issue. 2,
p.
207.
Frankl, P
and
Füredi, Z
1989.
Extremal problems whose solutions are the blowups of the small witt-designs.
Journal of Combinatorial Theory, Series A,
Vol. 52,
Issue. 1,
p.
129.
Pardalos, P. M.
and
Phillips, A. T.
1990.
A global optimization approach for solving the maximum clique problem.
International Journal of Computer Mathematics,
Vol. 33,
Issue. 3-4,
p.
209.
Pardalos, Panos M.
Ye, Yinyu
and
Han, Chi-Geun
1991.
Algorithms for the solution of quadratic knapsack problems.
Linear Algebra and its Applications,
Vol. 152,
Issue. ,
p.
69.
Sidorenko, A. F.
1991.
Inequalities in probability theory and turán‐type problems for graphs with colored vertices.
Random Structures & Algorithms,
Vol. 2,
Issue. 1,
p.
73.
Erdős, P.
Hajnal, A.
Simonovits, M.
Sós, V. T.
and
Szemerédi, E.
1993.
Turán-Ramsey theorems and simple asymptotically extremal structures.
Combinatorica,
Vol. 13,
Issue. 1,
p.
31.