|
Paul Seymour (mathematician)
Paul D. Seymour (born 26 July 1950) is a British mathematician known for his work in discrete mathematics, especially graph theory. He (with others) was responsible for important progress on regular matroids and totally unimodular matrices, the four colour theorem, linkless embeddings, graph minors and structure, the perfect graph conjecture, the Hadwiger conjecture, claw-free graphs, χ-boundedness, and the Erdős–Hajnal conjecture. Many of his recent papers are available from his website. Seymour is currently the Albert Baldwin Dod Professor of Mathematics at Princeton University. He won a Sloan Fellowship in 1983, and the Ostrowski Prize in 2004; and (sometimes with others) won the Fulkerson Prize in 1979, 1994, 2006 and 2009, and the Pólya Prize in 1983 and 2004. He received an honorary doctorate from the University of Waterloo in 2008, one from the Technical University of Denmark in 2013, and one from the École normale supérieure de Lyon in 2022. He was an invited ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Plymouth
Plymouth () is a port city and unitary authority in South West England. It is located on the south coast of Devon, approximately south-west of Exeter and south-west of London. It is bordered by Cornwall to the west and south-west. Plymouth's early history extends to the Bronze Age when a first settlement emerged at Mount Batten. This settlement continued as a trading post for the Roman Empire, until it was surpassed by the more prosperous village of Sutton founded in the ninth century, now called Plymouth. In 1588, an English fleet based in Plymouth intercepted and defeated the Spanish Armada. In 1620, the Pilgrim Fathers departed Plymouth for the New World and established Plymouth Colony, the second English settlement in what is now the United States of America. During the English Civil War, the town was held by the Roundhead, Parliamentarians and was besieged between 1642 and 1646. Throughout the Industrial Revolution, Plymouth grew as a commercial shipping port, handling ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Matroid
In mathematics, a regular matroid is a matroid that can be represented over all fields. Definition A matroid is defined to be a family of subsets of a finite set, satisfying certain axioms. The sets in the family are called "independent sets". One of the ways of constructing a matroid is to select a finite set of vectors in a vector space, and to define a subset of the vectors to be independent in the matroid when it is linearly independent in the vector space. Every family of sets constructed in this way is a matroid, but not every matroid can be constructed in this way, and the vector spaces over different fields lead to different sets of matroids that can be constructed from them. A matroid M is regular when, for every field F, M can be represented by a system of vectors over F.. Properties If a matroid is regular, so is its dual matroid, and so is every one of its minors. Every direct sum of regular matroids remains regular. Every graphic matroid (and every co-graphic matro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
École Normale Supérieure De Lyon
The École normale supérieure de Lyon (also known as ENS de Lyon, ENSL or Normale Sup' Lyon) is a French grande école located in the city of Lyon. It is one of the four prestigious écoles normales supérieures in France. The school is composed of two academic units— Arts and Sciences— with campuses in Lyon, near the confluence of the Rhône and Saône rivers. ENSL's students usually enjoy a special civil servant status in the wake of highly competitive exams, providing they pursue careers in public service. Although it maintains extensive connections with the University of Lyon and external research institutions, including the CNRS, the school remains independent. History Training teachers for normal schools ''L'École normale supérieure de Lyon'' is the descendant of two top educational institutions founded by Jules Ferry: *''L'École normale supérieure de Fontenay-aux-Roses'', for girls, founded in 1880. *''L'École normale supérieure de Saint-Cloud'', for b ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Technical University Of Denmark
The Technical University of Denmark ( da, Danmarks Tekniske Universitet), often simply referred to as DTU, is a polytechnic university and school of engineering. It was founded in 1829 at the initiative of Hans Christian Ørsted as Denmark's first polytechnic, and it is today ranked among Europe's leading engineering institutions. It is located in the town Kongens Lyngby, north of central Copenhagen, Denmark. Along with École Polytechnique in Paris, École Polytechnique Fédérale de Lausanne, Eindhoven University of Technology, Technical University of Munich and Technion – Israel Institute of Technology, DTU is a member of EuroTech Universities Alliance. History DTU was founded in 1829 as the "College of Advanced Technology" (Danish: Den Polytekniske Læreanstalt). The Physicist Hans Christian Ørsted, at that time a professor at the University of Copenhagen, was one of the driving forces behind this initiative. He was inspired by the École Polytechnique in Paris, Fran ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Albert Baldwin Dod
Albert Baldwin Dod (March 24, 1805 – November 20, 1845) was an American Presbyterian theologian and professor of mathematics. Early life Dod was born on March 24, 1805 in Mendham, New Jersey. He was the son of Daniel Dod (1778–1823) and Nancy (née Squire) Dod (1780–1851). His mother was the sister of Dr. Ezra Squire, of Caldwell, New Jersey. Career After a religious awakening while at college in Princeton, where he graduated with the class of 1822, Dod became affiliated with the influential Princeton Theologians. He published frequently in the group's chief outlet, the '' Biblical Repertory and Princeton Review'', edited by Charles Hodge. Among his publications there, an attack on Transcendentalism (perhaps written with James Waddel Alexander; published in the January 1839 issue) attracted wide notice and was later republished by Andrews Norton. For much of his life he taught mathematics at the College, and participated in theological discussion and preaching at the Se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Erdős–Hajnal Conjecture
In graph theory, a branch of mathematics, the Erdős–Hajnal conjecture states that families of graphs defined by forbidden induced subgraphs have either large cliques or large independent sets. It is named for Paul Erdős and András Hajnal. More precisely, for an arbitrary undirected graph H, let \mathcal_H be the family of graphs that do not have H as an induced subgraph. Then, according to the conjecture, there exists a constant \delta_H > 0 such that the n-vertex graphs in \mathcal_H have either a clique or an independent set of size \Omega(n^). An equivalent statement to the original conjecture is that, for every graph H, the H-free graphs all contain polynomially large perfect induced subgraphs. Graphs without large cliques or independent sets In contrast, for random graphs in the Erdős–Rényi model with edge probability 1/2, both the maximum clique and the maximum independent set are much smaller: their size is proportional to the logarithm of n, rather than growin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
χ-bounded
In graph theory, a \chi-bounded family \mathcal of graphs is one for which there is some function c such that, for every integer t the graphs in \mathcal with t=\omega(G) (clique number) can be colored with at most c(t) colors. This concept and its notation were formulated by András Gyárfás. The use of the Greek letter chi in the term \chi-bounded is based on the fact that the chromatic number of a graph G is commonly denoted \chi(G). Nontriviality It is not true that the family of all graphs is \chi-bounded. As and showed, there exist triangle-free graphs of arbitrarily large chromatic number, so for these graphs it is not possible to define a finite value of t(3). Thus, \chi-boundedness is a nontrivial concept, true for some graph families and false for others. Specific classes Every class of graphs of bounded chromatic number is (trivially) \chi-bounded, with c(t) equal to the bound on the chromatic number. This includes, for instance, the planar graphs, the bipartite gr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Claw-free Graph
In graph theory, an area of mathematics, a claw-free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph ''K''1,3 (that is, a star graph comprising three edges, three leaves, and a central vertex). A claw-free graph is a graph in which no induced subgraph is a claw; i.e., any subset of four vertices has other than only three edges connecting them in this pattern. Equivalently, a claw-free graph is a graph in which the neighborhood of any vertex is the complement of a triangle-free graph. Claw-free graphs were initially studied as a generalization of line graphs, and gained additional motivation through three key discoveries about them: the fact that all claw-free connected graphs of even order have perfect matchings, the discovery of polynomial time algorithms for finding maximum independent sets in claw-free graphs, and the characterization of claw-free perfect graphs., p. 88. They are the subject of hundreds ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hadwiger Conjecture (graph Theory)
In graph theory, the Hadwiger conjecture states that if G is loopless and has no K_t minor then its chromatic number satisfies It is known to be true for The conjecture is a generalization of the four-color theorem and is considered to be one of the most important and challenging open problems in the field. In more detail, if all proper colorings of an undirected graph G use k or more colors, then one can find k disjoint connected subgraphs of G such that each subgraph is connected by an edge to each other subgraph. Contracting the edges within each of these subgraphs so that each subgraph collapses to a single vertex produces a complete graph K_k on k vertices as a minor This conjecture, a far-reaching generalization of the four-color problem, was made by Hugo Hadwiger in 1943 and is still unsolved. call it "one of the deepest unsolved problems in graph theory." Equivalent forms An equivalent form of the Hadwiger conjecture (the contrapositive of the form stated above ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perfect Graph
In graph theory, a perfect graph is a graph in which the chromatic number of every induced subgraph equals the order of the largest clique of that subgraph (clique number). Equivalently stated in symbolic terms an arbitrary graph G=(V,E) is perfect if and only if for all S\subseteq V we have \chi(G =\omega(G . The perfect graphs include many important families of graphs and serve to unify results relating colorings and cliques in those families. For instance, in all perfect graphs, the graph coloring problem, maximum clique problem, and maximum independent set problem can all be solved in polynomial time. In addition, several important min-max theorems in combinatorics, such as Dilworth's theorem, can be expressed in terms of the perfection of certain associated graphs. A graph G is 1-perfect if and only if \chi(G)=\omega(G). Then, G is perfect if and only if every induced subgraph of G is 1-perfect. Properties * By the perfect graph theorem, a graph G is perfect if and on ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Robertson–Seymour Theorem
In graph theory, the Robertson–Seymour theorem (also called the graph minor theorem) states that the undirected graphs, partially ordered by the graph minor relationship, form a well-quasi-ordering. Equivalently, every family of graphs that is closed under minors can be defined by a finite set of forbidden minors, in the same way that Wagner's theorem characterizes the planar graphs as being the graphs that do not have the complete graph ''K''5 or the complete bipartite graph ''K''3,3 as minors. The Robertson–Seymour theorem is named after mathematicians Neil Robertson and Paul D. Seymour, who proved it in a series of twenty papers spanning over 500 pages from 1983 to 2004. Before its proof, the statement of the theorem was known as Wagner's conjecture after the German mathematician Klaus Wagner, although Wagner said he never conjectured it. A weaker result for trees is implied by Kruskal's tree theorem, which was conjectured in 1937 by Andrew Vázsonyi and proved in 1960 in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
