# W. G. Brown

William G. Brown is a Canadian mathematician specializing in graph theory. He is a professor emeritus of mathematics at McGill University.[1]

## Education and career

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).[2][3]

In 1968, he moved to McGill from the University of British Columbia as an associate professor.[4]

## Contributions

Brown's dissertation research concerned graph enumeration, and his early publications continued in that direction.[E][T] 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,[5][6][A][B] and for his constructions of dense ${\displaystyle K_{3,3}}$-free graphs in connection with the Zarankiewicz problem.[7][Z]

## Selected publications

 E. 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.mw-parser-output cite.citation{font-style:inherit}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-limited a,.mw-parser-output .citation .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .citation .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-ws-icon a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/4/4c/Wikisource-logo.svg/12px-Wikisource-logo.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-maint{display:none;color:#33aa33;margin-left:0.3em}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em}
 T. Brown, W. G.; Tutte, W. T. (1964), "On the enumeration of rooted non-separable planar maps", Canadian Journal of Mathematics, 16: 572–577, doi:10.4153/CJM-1964-058-7, MR 0177906
 Z. Brown, W. G. (1966), "On graphs that do not contain a Thomsen graph", Canadian Mathematical Bulletin, 9: 281–285, doi:10.4153/CMB-1966-036-2, MR 0200182
 A. 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
 B. Sós, V. T.; Erdős, P.; Brown, W. G. (1973), "On the existence of triangulated spheres in 3-graphs, and related problems" (PDF), Periodica Mathematica Hungarica, 3 (3–4): 221–228, doi:10.1007/BF02018585, MR 0323647

## References

1. ^ Emeritus Professors and Post Retirees, McGill University Mathematics and Statistics, retrieved 2019-02-03
2. ^
3. ^ Sherk, F. Arthur; McMullen, Peter; Thompson, Anthony C.; Weiss, Asia Ivić (1995), Kaleidoscopes: Selected Writings of H.S.M. Coxeter, Canadian Mathematical Society series of monographs and advanced texts, 12, John Wiley & Sons, p. xxvii, ISBN 9780471010036
4. ^ "News and Notices", The American Mathematical Monthly, 75 (3): 325–328, March 1968, doi:10.1080/00029890.1968.11970982, JSTOR 2315014
5. ^ 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.
6. ^ 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
7. ^ Bollobás, Béla (1998), Modern graph theory, Graduate Texts in Mathematics, 184, New York: Springer-Verlag, p. 115, doi:10.1007/978-1-4612-0619-4, ISBN 0-387-98488-7, MR 1633290