Lesson plan
Ed Scheinerman
Edward R. Scheinerman is an American mathematician, working in graph theory and order theory. He is a professor of applied mathematics, statistics, and computer science at Johns Hopkins University. His contributions to mathematics include Scheinerman's conjecture, now proven, stating that every planar graph may be represented as an intersection graph of line segments. Scheinerman did his undergraduate studies at Brown University, graduating in 1980, and earned his Ph.D. in 1984 from Princeton University under the supervision of Douglas B. West. He joined the Johns Hopkins faculty in 1984, and since 2000 he has been an administrator there, serving as department chair, associate dean, vice dean for education, vice dean for graduate education, and vice dean for faculty (effective September 2019). He is a two-time winner of the Mathematical Association of America's Lester R. Ford Award for expository writing, in 1991 for his paper "Random intervals" with Joyce Justicz and Peter Winkler, and in 2001 for his paper "When Close is Close Enough". In 1992 he became a fellow of the Institute of Combinatorics and its Applications, and in 2012 he became a fellow of the American Mathematical Society.
Article summary
Edward R. Scheinerman is an American mathematician, working in graph theory and order theory. He is a professor of applied mathematics, statistics, and computer science at Johns Hopkins University. His contributions to mathematics include Scheinerman's conjecture, now proven, stating that every planar graph may be represented as an intersection graph of line segments. Scheinerman did his undergraduate studies at Brown University, graduating in 1980, and earned his Ph.D. in 1984 from Princeton University under the supervision of Douglas B. West. He joined the Johns Hopkins faculty in 1984, and since 2000 he has been an administrator there, serving as department chair, associate dean, vice dean for education, vice dean for graduate education, and vice dean for faculty (effective September 2019). He is a two-time winner of the Mathematical Association of America's Lester R. Ford Award for expository writing, in 1991 for his paper "Random intervals" with Joyce Justicz and Peter Winkler, and in 2001 for his paper "When Close is Close Enough". In 1992 he became a fellow of the Institute of Combinatorics and its Applications, and in 2012 he became a fellow of the American Mathematical Society.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.