Article snapshot taken from Wikipedia with creative commons attribution-sharealike license.
Give it a read and then ask your questions in the chat.
We can research this topic together.
Brown's dissertation research concerned graph enumeration, and his early publications continued in that direction. However, much of his later work was in extremal graph theory. He is known for formulating the Ruzsa–Szemerédi problem on the density of systems of triples in which no six points contain more than two triples in joint work with Paul Erdős and Vera T. Sós, and for his constructions of dense -free graphs in connection with the Zarankiewicz problem.
Selected publications
E.
Brown, William G. (1964), "Enumeration of triangulations of the disk", Proceedings of the London Mathematical Society, Third Series, 14 (4): 746–768, doi:10.1112/plms/s3-14.4.746, MR0168485
Füredi, Zoltán (1991), "Turán type problems", in Keedwell, A. D. (ed.), Surveys in combinatorics, 1991: Papers from the Thirteenth British Combinatorial Conference held at the University of Surrey, Guildford, July 1991, London Mathematical Society Lecture Note Series, vol. 166, Cambridge, England: Cambridge University Press, pp. 253–300, doi:10.1017/CBO9780511666216, ISBN0-521-40766-4, MR1161467. See in particular p. 277.