Philip Franklin

Last updated
Philip Franklin
BornOctober 5, 1898
DiedJanuary 27, 1965 (1965-01-28) (aged 66)
Known for Franklin graph
Scientific career
Doctoral advisor Oswald Veblen
Doctoral students Alan Perlis

Philip Franklin (October 5, 1898  January 27, 1965) was an American mathematician and professor whose work was primarily focused in analysis.

Dr. Franklin received a B.S. in 1918 from City College of New York (who later awarded him its Townsend Harris Medal for the alumnus who achieved notable postgraduate distinction). He received his M.A. in 1920 and Ph.D. in 1921 both from Princeton University. His dissertation, The Four Color Problem, was supervised by Oswald Veblen. After teaching for one year at Princeton and two years at Harvard University (as the Benjamin Peirce Instructor), Franklin joined the Massachusetts Institute of Technology Department of Mathematics, where he stayed until his 1964 retirement.

In 1922, Franklin gave the first proof that all planar graphs with at most 25 vertices can be four-colored. [1]

In 1928, Franklin gave the first description of an orthonormal basis for L²([0,1]) consisting of continuous functions (now known as "Franklin's system"). [2]

In 1934, Franklin disproved the Heawood conjecture for the Klein bottle by showing that any map drawn on the Klein bottle can be coloured with at most six colours. An example which shows that six colours may be needed is the 12-vertex cubic graph now known as the Franklin graph. [3] [4] [5]

Franklin also worked with Jay W. Forrester on Project Whirlwind at the Office of Naval Research (ONR).

Franklin was editor of the MIT Journal of Mathematics and Physics from 1929.

In 1940 his comprehensive textbook A Treatise on Advanced Calculus was first published.

Franklin was married to Norbert Wiener's sister Constance. Their son-in-law is Václav E. Beneš. [6]

Related Research Articles

Conjecture Proposition in mathematics that is unproven

In mathematics, a conjecture is a conclusion or a proposition which is suspected to be true due to preliminary supporting evidence, but for which no proof or disproof has yet been found. Some conjectures, such as the Riemann hypothesis or Fermat's Last Theorem, have shaped much of mathematical history as new areas of mathematics are developed in order to prove them.

Four color theorem Statement in mathematics

In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. Adjacent means that two regions share a common boundary curve segment, not merely a corner where three or more regions meet. It was the first major theorem to be proved using a computer. Initially, this proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand. Since then the proof has gained wide acceptance, although some doubters remain.

In mathematics, Tait's conjecture states that "Every 3-connected planar cubic graph has a Hamiltonian cycle through all its vertices". It was proposed by P. G. Tait (1884) and disproved by W. T. Tutte (1946), who constructed a counterexample with 25 faces, 69 edges and 46 vertices. Several smaller counterexamples, with 21 faces, 57 edges and 38 vertices, were later proved minimal by Holton & McKay (1988). The condition that the graph be 3-regular is necessary due to polyhedra such as the rhombic dodecahedron, which forms a bipartite graph with six degree-four vertices on one side and eight degree-three vertices on the other side; because any Hamiltonian cycle would have to alternate between the two sides of the bipartition, but they have unequal numbers of vertices, the rhombic dodecahedron is not Hamiltonian.

In the mathematical field of graph theory, a vertex-transitive graph is a graph G in which, given any two vertices v1 and v2 of G, there is some automorphism

Snark (graph theory) Bridgeless cubic graph with chromatic index equal to 4

In the mathematical field of graph theory, a snark is a simple, connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, the connectivity is redundant so that removing no one edge would split the graph, and the edges cannot be colored by only three colors without two edges of the same color meeting at a point. In order to avoid trivial cases, snarks are often restricted to have girth at least 5.

Cubic graph

In the mathematical field of graph theory, a cubic graph is a graph in which all vertices have degree three. In other words, a cubic graph is a 3-regular graph. Cubic graphs are also called trivalent graphs.

Net (polyhedron)

In geometry, a net of a polyhedron is an arrangement of non-overlapping edge-joined polygons in the plane which can be folded to become the faces of the polyhedron. Polyhedral nets are a useful aid to the study of polyhedra and solid geometry in general, as they allow for physical models of polyhedra to be constructed from material such as thin cardboard.

Alternating knot

In knot theory, a knot or link diagram is alternating if the crossings alternate under, over, under, over, as one travels along each component of the link. A link is alternating if it has an alternating diagram.

Heawood graph

In the mathematical field of graph theory, the Heawood graph is an undirected graph with 14 vertices and 21 edges, named after Percy John Heawood.

In graph theory, the Heawood conjecture or Ringel–Youngs theorem gives a lower bound for the number of colors that are necessary for graph coloring on a surface of a given genus. For surfaces of genus 0, 1, 2, 3, 4, 5, 6, 7, ..., the required number of colors is 4, 7, 8, 9, 10, 11, 12, 12, .... OEIS: A000934, the chromatic number or Heawood number.

Doron Zeilberger Israeli mathematician

Doron Zeilberger is an Israeli mathematician, known for his work in combinatorics.

Heawood number

In mathematics, the Heawood number of a surface is an upper bound for the number of colors that suffice to color any graph embedded in the surface.

Coxeter graph

In the mathematical field of graph theory, the Coxeter graph is a 3-regular graph with 28 vertices and 42 edges. It is one of the 13 known cubic distance-regular graphs. It is named after Harold Scott MacDonald Coxeter.

Václav Chvátal Czech-Canadian mathematician

Václav (Vašek) Chvátal is a Professor Emeritus in the Department of Computer Science and Software Engineering at Concordia University in Montreal, Quebec, Canada. He has published extensively on topics in graph theory, combinatorics, and combinatorial optimization.

Structural rigidity Combinatorial theory of mechanics and discrete geometry

In discrete geometry and mechanics, structural rigidity is a combinatorial theory for predicting the flexibility of ensembles formed by rigid bodies connected by flexible linkages or hinges.

Franklin graph

In the mathematical field of graph theory, the Franklin graph is a 3-regular graph with 12 vertices and 18 edges.

Polyhedral graph

In geometric graph theory, a branch of mathematics, a polyhedral graph is the undirected graph formed from the vertices and edges of a convex polyhedron. Alternatively, in purely graph-theoretic terms, the polyhedral graphs are the 3-vertex-connected planar graphs.

Joan Prince Hutchinson is an American mathematician and Professor Emerita of Mathematics from Macalester College.​​

Poussin graph

In graph theory, the Poussin graph is a planar graph with 15 vertices and 39 edges. It is named after Charles Jean de la Vallée-Poussin.

References

  1. Franklin, P. "The Four Color Problem." Amer. J. Math. 44 (1922), 225-236. doi : 10.2307/2370527
  2. Franklin, P. "A set of continuous orthogonal functions", Math. Ann. 100 (1928), 522-529. doi : 10.1007/BF01448860
  3. Weisstein, Eric W. "Franklin Graph". MathWorld .
  4. Weisstein, Eric W. "Heawood conjecture". MathWorld .
  5. Franklin, P. "A Six Color Problem." J. Math. Phys. 13 (1934), 363-379. doi : 10.1002/sapm1934131363
  6. http://www-history.mcs.st-and.ac.uk/Biographies/Franklin.html