|
Anthony Hilton
Anthony J. W. Hilton (born 4 April 1941) is a British mathematician specializing in combinatorics and graph theory. His current positions are as emeritus professor of Combinatorial Mathematics at the University of Reading and professorial research fellow at Queen Mary College, University of London. Education From 1951 to 1959, he attended the Bedford School in Bedford, Bedfordshire, England. From there he attended Reading University, where he earned a bachelor's degree in 1963 and was awarded a PhD in 1967.Hilton, Anthony Personal Homepage/ref> His dissertation was "Representation Theorems for Integers and Real Numbers" under his advisor David E. Daykin.Anthony Hilton The Mathematics Genealogy Project Work Much of his work has been done in pioneering techniques in graph theory. He has discovered many ...[...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is gra ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Amanda Chetwynd
Amanda G. Chetwynd is a British mathematician and statistician specializing in combinatorics and spatial statistics. She is Professor of Mathematics and Statistics and Provost for Student Experience, Colleges and the Library at Lancaster University, and a Principal Fellow of the Higher Education Academy. Education and research Chetwynd earned a Ph.D. from the Open University in 1985. Her dissertation, ''Edge-colourings of graphs'', was jointly supervised by Anthony Hilton and Robin Wilson. She did postdoctoral research at the University of Stockholm before joining Lancaster University. Her research interests include graph theory, edge coloring, and latin squares in combinatorics, as well as geographical clustering in medical statistics. Recognition and service In 2003, Chetwynd won a National Teaching Fellowship recognizing her teaching excellence. She was vice president of the London Mathematical Society in 2005, at a time when university study of mathematics was shrinking, a ... [...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] |
1941 Births
Events Below, the events of World War II have the "WWII" prefix. January * January–August – 10,072 men, women and children with mental and physical disabilities are asphyxiated with carbon monoxide in a gas chamber, at Hadamar Euthanasia Centre in Germany, in the first phase of mass killings under the Action T4 program here. * January 1 – Thailand's Prime Minister Plaek Phibunsongkhram decrees January 1 as the official start of the Thai solar calendar new year (thus the previous year that began April 1 had only 9 months). * January 3 – A decree (''Normalschrifterlass'') promulgated in Germany by Martin Bormann, on behalf of Adolf Hitler, requires replacement of blackletter typefaces by Antiqua. * January 4 – The short subject ''Elmer's Pet Rabbit'' is released, marking the second appearance of Bugs Bunny, and also the first to have his name on a title card. * January 5 – WWII: Battle of Bardia in Libya: Australian and British troops def ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Conjecture
In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis (still a conjecture) or Fermat's Last Theorem (a conjecture until proven in 1995 by Andrew Wiles), have shaped much of mathematical history as new areas of mathematics are developed in order to prove them. Important examples Fermat's Last Theorem In number theory, Fermat's Last Theorem (sometimes called Fermat's conjecture, especially in older texts) states that no three positive integers a, ''b'', and ''c'' can satisfy the equation ''a^n + b^n = c^n'' for any integer value of ''n'' greater than two. This theorem was first conjectured by Pierre de Fermat in 1637 in the margin of a copy of '' Arithmetica'', where he claimed that he had a proof that was too large to fit in the margin. The first successful proof was released in 1994 by Andrew Wiles, and formally published in 1995, after 358 years of effort by mathe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamiltonian Decomposition
In graph theory, a branch of mathematics, a Hamiltonian decomposition of a given graph is a partition of the edges of the graph into Hamiltonian cycles. Hamiltonian decompositions have been studied both for undirected graphs and for directed graphs. In the undirected case a Hamiltonian decomposition can also be described as a 2-factorization of the graph such that each factor is connected. Necessary conditions For a Hamiltonian decomposition to exist in an undirected graph, the graph must be connected and regular of even degree. A directed graph with such a decomposition must be strongly connected and all vertices must have the same in-degree and out-degree as each other, but this degree does not need to be even. Special classes of graphs Complete graphs Every complete graph with an odd number n of vertices has a Hamiltonian decomposition. This result, which is a special case of the Oberwolfach problem of decomposing complete graphs into isomorphic 2-factors, was attributed to W ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Amalgamation
In graph theory, a graph amalgamation is a relationship between two graphs (one graph is an amalgamation of another). Similar relationships include subgraphs and minors. Amalgamations can provide a way to reduce a graph to a simpler graph while keeping certain structure intact. The amalgamation can then be used to study properties of the original graph in an easier to understand context. Applications include embeddings,Gross, Tucker 1987 computing genus distribution,Gross 2011 and Hamiltonian decompositions. Definition Let G and H be two graphs with the same number of edges where G has more vertices than H. Then we say that H is an amalgamation of G if there is a bijection \phi: E(G) \to E(H) and a surjection \psi: V(G) \to V(H) and the following hold: * If x, y are two vertices in G where \psi(x) \neq \psi(y), and both x and y are adjacent by edge e in G, then \psi(x) and \psi(y) are adjacent by edge \phi(e) in H. * If e is a loop on a vertex x \in V(G), then \phi(e) is a l ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
London Mathematical Society
The London Mathematical Society (LMS) is one of the United Kingdom's learned societies for mathematics (the others being the Royal Statistical Society (RSS), the Institute of Mathematics and its Applications (IMA), the Edinburgh Mathematical Society and the Operational Research Society (ORS). History The Society was established on 16 January 1865, the first president being Augustus De Morgan. The earliest meetings were held in University College, but the Society soon moved into Burlington House, Piccadilly. The initial activities of the Society included talks and publication of a journal. The LMS was used as a model for the establishment of the American Mathematical Society in 1888. Mary Cartwright was the first woman to be President of the LMS (in 1961–62). The Society was granted a royal charter in 1965, a century after its foundation. In 1998 the Society moved from rooms in Burlington House into De Morgan House (named after the society's first president), at 57–5 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Edge Coloring
In graph theory, an edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color. For example, the figure to the right shows an edge coloring of a graph by the colors red, blue, and green. Edge colorings are one of several different types of graph coloring. The edge-coloring problem asks whether it is possible to color the edges of a given graph using at most different colors, for a given value of , or with the fewest possible colors. The minimum required number of colors for the edges of a given graph is called the chromatic index of the graph. For example, the edges of the graph in the illustration can be colored by three colors but cannot be colored by two colors, so the graph shown has chromatic index three. By Vizing's theorem, the number of colors needed to edge color a simple graph is either its maximum degree or . For some graphs, such as bipartite graphs and high-degree planar graphs, the number of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euler Medal
The Institute of Combinatorics and its Applications (ICA) is an international scientific organization formed in 1990 to increase the visibility and influence of the combinatorial community. In pursuit of this goal, the ICA sponsors conferences, publishes a bulletin and awards a number of medals, including the Euler, Hall, Kirkman, and Stanton Medals. It is based in Duluth, Minnesota and its operation office is housed at University of Minnesota Duluth. The institute was minimally active between 2010 and 2016 and resumed its full activities in March 2016. Membership The ICA has over 800 members in over forty countries. Membership is at three levels. ''Members'' are those who have not yet completed a Ph.D. ''Associate Fellows'' are younger members who have received the Ph.D. or have published extensively; normally an Associate Fellow should hold the rank of Assistant Professor. ''Fellows'' are expected to be established scholars and typically have the rank of Associate Professor or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Factorization
In graph theory, a factor of a graph ''G'' is a spanning subgraph, i.e., a subgraph that has the same vertex set as ''G''. A ''k''-factor of a graph is a spanning ''k''- regular subgraph, and a ''k''-factorization partitions the edges of the graph into disjoint ''k''-factors. A graph ''G'' is said to be ''k''-factorable if it admits a ''k''-factorization. In particular, a 1-factor is a perfect matching, and a 1-factorization of a ''k''-regular graph is an edge coloring with ''k'' colors. A 2-factor is a collection of cycles that spans all vertices of the graph. 1-factorization If a graph is 1-factorable (ie, has a 1-factorization), then it has to be a regular graph. However, not all regular graphs are 1-factorable. A ''k''-regular graph is 1-factorable if it has chromatic index ''k''; examples of such graphs include: * Any regular bipartite graph. Hall's marriage theorem can be used to show that a ''k''-regular bipartite graph contains a perfect matching. One can then remove t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
