William G. Brown is a Canadian mathematician specializing in graph theory. He is a professor emeritus of mathematics at McGill University.
Education and career [ edit ]
Brown earned his Ph.D. from the
University of Toronto in 1963, under the joint supervision of Harold Scott MacDonald Coxeter and W. T. Tutte. His dissertation was Enumeration Problems Of Linear Graph Theory (Problems in the Enumeration of Maps). 
In 1968, he moved to McGill from the
University of British Columbia as an associate professor.
Contributions [ edit ]
Brown's dissertation research concerned
graph enumeration, and his early publications continued in that direction. [E] However, much of his later work was in [T] 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,   [A] and for his constructions of dense [B] -free graphs in connection with the
Zarankiewicz problem. 
Selected publications [ edit ]
Brown, William G. (1964), "Enumeration of triangulations of the disk", Proceedings of the London Mathematical Society, Third Series, 14: 746–768, doi: 10.1112/plms/s3-14.4.746, MR 0168485
Brown, W. G.; Erdős, P.; Sós, V. T. (1973), "Some extremal problems on r-graphs" (PDF), New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich, 1971), New York: Academic Press: 53–63, MR 0351888
References [ edit ]
, McGill University Mathematics and Statistics Emeritus Professors and Post Retirees , retrieved 2019-02-03
W. G. Brown at the Mathematics Genealogy Project
Sherk, F. Arthur; McMullen, Peter; Thompson, Anthony C.; Weiss, Asia Ivić (1995), , Canadian Mathematical Society series of monographs and advanced texts, Kaleidoscopes: Selected Writings of H.S.M. Coxeter 12, John Wiley & Sons, p. xxvii, ISBN 9780471010036
"News and Notices", The American Mathematical Monthly, 75 (3): 325–328, March 1968, doi: 10.1080/00029890.1968.11970982, JSTOR 2315014
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, 166, Cambridge, England: Cambridge University Press, pp. 253–300, doi: 10.1017/CBO9780511666216, ISBN , 0-521-40766-4 MR 1161467 . See in particular p. 277.
Nagle, Brendan; Rödl, Vojtěch; Schacht, Mathias (2006), "Extremal hypergraph problems and the regularity method", in Klazar, Martin; Kratochvíl, Jan; Loebl, Martin; Matoušek, Jiří; Thomas, Robin; Valtr, Pavel (eds.), Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the occasion of his 60th birthday, Algorithms and Combinatorics, 26, Berlin: Springer, pp. 247–278, doi: 10.1007/3-540-33700-8_16, MR 2249275
Bollobás, Béla (1998), , Graduate Texts in Mathematics, Modern graph theory 184, New York: Springer-Verlag, p. 115, doi: 10.1007/978-1-4612-0619-4, ISBN , 0-387-98488-7 MR 1633290
External links [ edit ]