W. G. Brown
William G. Brown is a Canadian mathematician specializing in graph theory. He is a professor emeritus of mathematics at McGill University. Education and career Brown earned his Ph.D. from the University of Toronto in 1963, under the joint supervision of Harold Scott MacDonald Coxeter Harold Scott MacDonald "Donald" Coxeter, (9 February 1907 – 31 March 2003) was a British and later also Canadian geometer. He is regarded as one of the greatest geometers of the 20th century. Biography Coxeter was born in Kensington t ... 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 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–Szem ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Vera T
Vera may refer to: Names *Vera (surname), a surname (including a list of people with the name) *Vera (given name), a given name (including a list of people and fictional characters with the name) **Vera (), archbishop of the archdiocese of Tarragona Places Spain *Vera, Almería, a municipality in the province of Almería, Andalusia *Vera de Bidasoa, a municipality in the autonomous community of Navarra *La Vera, a comarca in the province of Cáceres, Extremadura United States *Vera, Illinois, an unincorporated community * Vera, Kansas, a ghost town * Vera, Missouri, an unincorporated community * Vera, Oklahoma, a town *Vera, Texas, an unincorporated community * Vera, Virginia, an unincorporated community *Veradale, Washington, originally known as Vera, CDP Elsewhere *Vera, Santa Fe, a city in the province of Santa Fe, Argentina *Vera Department, an administrative subdivision (departamento) of the province of Santa Fe * Vera, Mato Grosso, Brazil, a municipality *Cape Vera, Nun ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Graph Theorists
Graph may refer to: Mathematics *Graph (discrete mathematics), a structure made of vertices and edges **Graph theory, the study of such graphs and their properties *Graph (topology), a topological space resembling a graph in the sense of discrete mathematics * Graph of a function *Graph of a relation *Graph paper *Chart, a means of representing data (also called a graph) Computing * Graph (abstract data type), an abstract data type representing relations or connections *graph (Unix), Unix command-line utility *Conceptual graph, a model for knowledge representation and reasoning Other uses * HMS ''Graph'', a submarine of the UK Royal Navy See also *Complex network *Graf *Graff (other) *Graph database *Grapheme, in linguistics *Graphemics *Graphic (other) *-graphy (suffix from the Greek for "describe," "write" or "draw") *List of information graphics software This is a list of software to create any kind of information graphics: * either includes the ability t ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Canadian Mathematicians
Canadians (french: Canadiens) are people identified with the country of Canada. This connection may be residential, legal, historical or cultural. For most Canadians, many (or all) of these connections exist and are collectively the source of their being ''Canadian''. Canada is a multilingual and multicultural society home to people of groups of many different ethnic, religious, and national origins, with the majority of the population made up of Old World immigrants and their descendants. Following the initial period of French and then the much larger British colonization, different waves (or peaks) of immigration and settlement of non-indigenous peoples took place over the course of nearly two centuries and continue today. Elements of Indigenous, French, British, and more recent immigrant customs, languages, and religions have combined to form the culture of Canada, and thus a Canadian identity. Canada has also been strongly influenced by its linguistic, geographic, and e ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Year Of Birth Missing (living People)
A year or annus is the orbital period of a planetary body, for example, the Earth, moving in its orbit around the Sun. Due to the Earth's axial tilt, the course of a year sees the passing of the seasons, marked by change in weather, the hours of daylight, and, consequently, vegetation and soil fertility. In temperate and subpolar regions around the planet, four seasons are generally recognized: spring, summer, autumn and winter. In tropical and subtropical regions, several geographical sectors do not present defined seasons; but in the seasonal tropics, the annual wet and dry seasons are recognized and tracked. A calendar year is an approximation of the number of days of the Earth's orbital period, as counted in a given calendar. The Gregorian calendar, or modern calendar, presents its calendar year to be either a common year of 365 days or a leap year of 366 days, as do the Julian calendars. For the Gregorian calendar, the average length of the calendar year (the ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Canadian Mathematical Bulletin
The ''Canadian Mathematical Bulletin'' (french: Bulletin Canadien de Mathématiques) is a mathematics journal, established in 1958 and published quarterly by the Canadian Mathematical Society. The current editors-in-chief of the journal are Antonio Lei and Javad Mashreghi. The journal publishes short articles in all areas of mathematics that are of sufficient interest to the general mathematical public. Abstracting and indexing The journal is abstracted in: for the Canadian Mathematical Bulletin. * '''' * '' [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Canadian Journal Of Mathematics
The ''Canadian Journal of Mathematics'' (french: Journal canadien de mathématiques) is a bimonthly mathematics journal published by the Canadian Mathematical Society. It was established in 1949 by H. S. M. Coxeter and G. de B. Robinson. The current editors-in-chief of the journal are Louigi Addario-Berry and Eyal Goren. The journal publishes articles in all areas of mathematics. See also * Canadian Mathematical Bulletin The ''Canadian Mathematical Bulletin'' (french: Bulletin Canadien de Mathématiques) is a mathematics journal, established in 1958 and published quarterly by the Canadian Mathematical Society. The current editors-in-chief of the journal are Antoni ... References External links * University of Toronto Press academic journals Mathematics journals Publications established in 1949 Bimonthly journals Multilingual journals Cambridge University Press academic journals Academic journals associated with learned and professional societies of Canada ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Zarankiewicz Problem
The Zarankiewicz problem, an unsolved problem in mathematics, asks for the largest possible number of edges in a bipartite graph that has a given number of vertices and has no complete bipartite subgraphs of a given size.. Reprint of 1978 Academic Press edition, . It belongs to the field of extremal graph theory, a branch of combinatorics, and is named after the Polish mathematician Kazimierz Zarankiewicz, who proposed several special cases of the problem in 1951. Problem statement A bipartite graph G=(U\cup V,E) consists of two disjoint sets of vertices U and V, and a set of edges each of which connects a vertex in U to a vertex in V. No two edges can both connect the same pair of vertices. A complete bipartite graph is a bipartite graph in which every pair of a vertex from U and a vertex from V is connected to each other. A complete bipartite graph in which U has s vertices and V has t vertices is denoted K_. If G=(U\cup V,E) is a bipartite graph, and there exists a set of s ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Paul Erdős
Paul Erdős ( hu, Erdős Pál ; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century. pursued and proposed problems in discrete mathematics, graph theory, number theory, mathematical analysis, approximation theory, set theory, and probability theory. Much of his work centered around discrete mathematics, cracking many previously unsolved problems in the field. He championed and contributed to Ramsey theory, which studies the conditions in which order necessarily appears. Overall, his work leaned towards solving previously open problems, rather than developing or exploring new areas of mathematics. Erdős published around 1,500 mathematical papers during his lifetime, a figure that remains unsurpassed. He firmly believed mathematics to be a social activity, living an itinerant lifestyle with the sole purpose of writing mathematical papers with other mathem ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Professor Emeritus
''Emeritus'' (; female: ''emerita'') is an adjective used to designate a retired chair, professor, pastor, bishop, pope, director, president, prime minister, rabbi, emperor, or other person who has been "permitted to retain as an honorary title the rank of the last office held". In some cases, the term is conferred automatically upon all persons who retire at a given rank, but in others, it remains a mark of distinguished service awarded selectively on retirement. It is also used when a person of distinction in a profession retires or hands over the position, enabling their former rank to be retained in their title, e.g., "professor emeritus". The term ''emeritus'' does not necessarily signify that a person has relinquished all the duties of their former position, and they may continue to exercise some of them. In the description of deceased professors emeritus listed at U.S. universities, the title ''emeritus'' is replaced by indicating the years of their appointmentsThe Protoc ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Ruzsa–Szemerédi Problem
In combinatorial mathematics and extremal graph theory, the Ruzsa–Szemerédi problem or (6,3)-problem asks for the maximum number of edges in a graph in which every edge belongs to a unique triangle. Equivalently it asks for the maximum number of edges in a balanced bipartite graph whose edges can be partitioned into a linear number of induced matchings, or the maximum number of triples one can choose from n points so that every six points contain at most two triples. The problem is named after Imre Z. Ruzsa and Endre Szemerédi, who first proved that its answer is smaller than n^2 by a slowly-growing (but still unknown) factor. Equivalence between formulations The following questions all have answers that are asymptotically equivalent: they differ by, at most, constant factors from each other. *What is the maximum possible number of edges in a graph with n vertices in which every edge belongs to a unique triangle? The graphs with this property are called locally linear graph ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |