请输入您要查询的百科知识：

　

词条 W. G. Brown
释义

  1. Education and career

  2. Contributions

  3. Selected publications

  4. References

  5. External links

William G. Brown is a Canadian mathematician specializing in graph theory. He is a professor emeritus of mathematics at McGill University.{{r|em}}

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).{{r|mg|kal}}

In 1968, he moved to McGill from the University of British Columbia as an associate professor.{{r|nn}}

Contributions

Brown's dissertation research concerned graph enumeration, and his early publications continued in that direction.{{ran|E}}{{ran|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,{{r|zf|nrs}}{{ran|A}}{{ran|B}} and for his constructions of dense -free graphs in connection with the Zarankiewicz problem.{{r|bb}}{{ran|Z}}

Selected publications

{{rma|E|{{citation
| last = Brown | first = William G.
| doi = 10.1112/plms/s3-14.4.746
| journal = Proceedings of the London Mathematical Society
| mr = 0168485
| pages = 746–768
| series = Third Series
| title = Enumeration of triangulations of the disk
| volume = 14
| year = 1964}}}}{{rma|T|{{citation
| last1 = Brown | first1 = W. G.
| last2 = Tutte | first2 = W. T. | author2-link = W. T. Tutte
| doi = 10.4153/CJM-1964-058-7
| journal = Canadian Journal of Mathematics
| mr = 0177906
| pages = 572–577
| title = On the enumeration of rooted non-separable planar maps
| volume = 16
| year = 1964}}}}{{rma|Z|{{citation
| last = Brown | first = W. G.
| doi = 10.4153/CMB-1966-036-2
| journal = Canadian Mathematical Bulletin
| mr = 0200182
| pages = 281–285
| title = On graphs that do not contain a Thomsen graph
| volume = 9
| year = 1966}}}}{{rma|A|{{citation
| last1 = Brown | first1 = W. G.
| last2 = Erdős | first2 = P. | author2-link = Erdős
| last3 = Sós | first3 = V. T. | author3-link = Vera T. Sós
| journal = New directions in the theory of graphs (Proc. Third Ann Arbor Conf., Univ. Michigan, Ann Arbor, Mich, 1971)
| mr = 0351888
| pages = 53–63
| publisher = Academic Press | location = New York
| title = Some extremal problems on {{mvar|r}}-graphs
| url = https://users.renyi.hu/~p_erdos/1973-25.pdf
| year = 1973}}}}{{rma|B|{{citation
| last1 = Sós | first1 = V. T. | author1-link = Vera T. Sós
| last2 = Erdős | first2 = P. | author2-link = Paul Erdős
| last3 = Brown | first3 = W. G.
| doi = 10.1007/BF02018585
| issue = 3-4
| journal = Periodica Mathematica Hungarica
| mr = 0323647
| pages = 221–228
| title = On the existence of triangulated spheres in 3-graphs, and related problems
| url = https://users.renyi.hu/~p_erdos/1973-15.pdf
| volume = 3
| year = 1973}}}}

References

1. ^{{citation|url=https://www.mcgill.ca/mathstat/people-0/emeritus-professors-and-post-retirees|title=Emeritus Professors and Post Retirees|publisher=McGill University Mathematics and Statistics|accessdate=2019-02-03}}
2. ^{{citation | last1 = Sherk | first1 = F. Arthur | last2 = McMullen | first2 = Peter | last3 = Thompson | first3 = Anthony C. | last4 = Weiss | first4 = Asia Ivić | isbn = 9780471010036 | page = xxvii | publisher = John Wiley & Sons | series = Canadian Mathematical Society series of monographs and advanced texts | title = Kaleidoscopes: Selected Writings of H.S.M. Coxeter | url = https://books.google.com/books?id=fUm5Mwfx8rAC&pg=PR27 | volume = 12 | year = 1995}}
3. ^{{mathgenealogy|id=15931}}
4. ^{{citation | date = March 1968 | issue = 3 | journal = The American Mathematical Monthly | jstor = 2315014 | pages = 325–328 | title = News and Notices | volume = 75}}
5. ^{{citation | last1 = Nagle | first1 = Brendan | last2 = Rödl | first2 = Vojtěch | author2-link = Vojtěch Rödl | last3 = Schacht | first3 = Mathias | author3-link = Mathias Schacht | editor1-last = Klazar | editor1-first = Martin | editor2-last = Kratochvíl | editor2-first = Jan | editor2-link = Jan Kratochvíl | editor3-last = Loebl | editor3-first = Martin | editor4-last = Matoušek | editor4-first = Jiří | editor4-link = Jiří Matoušek (mathematician) | editor5-last = Thomas | editor5-first = Robin | editor5-link = Robin Thomas (mathematician) | editor6-last = Valtr | editor6-first = Pavel | contribution = Extremal hypergraph problems and the regularity method | doi = 10.1007/3-540-33700-8_16 | location = Berlin | mr = 2249275 | pages = 247–278 | publisher = Springer | series = Algorithms and Combinatorics | title = Topics in Discrete Mathematics: Dedicated to Jarik Nešetřil on the occasion of his 60th birthday | volume = 26 | year = 2006}}
6. ^{{citation | last = Füredi | first = Zoltán | author-link = Zoltán Füredi | editor-last = Keedwell | editor-first = A. D. | contribution = Turán type problems | doi = 10.1017/CBO9780511666216 | isbn = 0-521-40766-4 | location = Cambridge, England | mr = 1161467 | pages = 253–300 | publisher = Cambridge University Press | series = London Mathematical Society Lecture Note Series | title = Surveys in combinatorics, 1991: Papers from the Thirteenth British Combinatorial Conference held at the University of Surrey, Guildford, July 1991 | volume = 166 | year = 1991}}. See in particular [https://books.google.com/books?id=4hWxnsLIfVAC&pg=PA277 p. 277].
[1][2][3][4][5][6]
}}

External links

  • Home page
{{Authority control}}{{DEFAULTSORT:Brown, W. G.}}

7 : Year of birth missing (living people)|Living people|Canadian mathematicians|Graph theorists|University of Toronto|University of British Columbia faculty|McGill University faculty
随便看

　

开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。

　

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间：2024/9/24 6:33:51