Ed Scheinerman

Edward R. Scheinerman is an American mathematician whose work lies at the intersection of graph theory, order theory, and combinatorial mathematics. He has spent the bulk of his professional life at Johns Hopkins University, where he has been a prolific researcher, educator, and administrator.

Table of Contents

1. [Overview](#overview)
2. [Early Life and Education](#early-life-and-education)
3. [Academic Career at Johns Hopkins University](#academic-career-at-johns-hopkins-university)
4. [Research Contributions](#research-contributions)

• 4.1 [Scheinerman’s Conjecture and Planar Graphs](#scheinermans-conjecture-and-planar-graphs)
• 4.2 [Work in Order Theory](#work-in-order-theory)
• 4.3 [Broader Influence on Graph Theory](#broader-influence-on-graph-theory)

1. [Expository Writing and the Lester R. Ford Awards](#expository-writing-and-the-lester-r-ford-awards)
2. [Professional Service and Leadership Roles](#professional-service-and-leadership-roles)
3. [Recognition by Professional Societies](#recognition-by-professional-societies)
4. [Why Scheinerman Matters to the Mathematical Community](#why-scheinerman-matters-to-the-mathematical-community)
5. [Conclusion](#conclusion)
6. [FAQ](#faq)

Overview

Edward R. Scheinerman is a distinguished American mathematician whose primary research interests are graph theory and order theory. He holds a joint appointment in the departments of applied mathematics, statistics, and computer science at Johns Hopkins University (JHU). Over a career spanning more than three decades, Scheinerman has contributed fundamental results—most famously Scheinerman’s conjecture, which asserts that every planar graph can be represented as an intersection graph of line segments. The conjecture was eventually proved, cementing his name in the annals of combinatorial geometry.

Beyond research, Scheinerman is celebrated for his clear expository writing, earning two Mathematical Association of America (MAA) Lester R. Ford Awards. He has also served in a succession of administrative capacities at JHU, influencing curriculum design, graduate education, and faculty development. His professional honors include fellowship in the Institute of Combinatorics and its Applications (ICCA) and the American Mathematical Society (AMS).

Early Life and Education

Scheinerman’s formal mathematical training began at Brown University, where he completed his undergraduate studies in 1980. He then pursued graduate work at Princeton University, earning a Ph.D. in 1984 under the supervision of Douglas B. West, a prominent figure in graph theory. The rigorous environment at Princeton, combined with West’s mentorship, helped shape Scheinerman’s later research trajectory, especially his focus on combinatorial structures and their geometric representations.

Academic Career at Johns Hopkins University

Immediately after receiving his doctorate, Scheinerman joined the Johns Hopkins faculty in 1984. Over the ensuing decades, he has held a joint professorship in applied mathematics, statistics, and computer science, reflecting the interdisciplinary nature of his work.

Since 2000, Scheinerman has taken on an increasingly prominent administrative portfolio at JHU, including:

These roles illustrate Scheinerman’s commitment not only to research but also to shaping the next generation of mathematicians, statisticians, and computer scientists.

Research Contributions

Scheinerman’s Conjecture and Planar Graphs

The most widely recognized of Scheinerman’s contributions is Scheinerman’s conjecture:

Every planar graph may be represented as an intersection graph of line segments.

In graph‑theoretic language, a planar graph is one that can be drawn on the plane without edge crossings. An intersection graph of line segments is built by assigning a line segment to each vertex; two vertices become adjacent precisely when their corresponding segments intersect.

The conjecture, proposed by Scheinerman in the early 1990s, sparked a flurry of activity in combinatorial geometry. Its eventual proof (by independent researchers after the conjecture’s formulation) confirmed a deep link between planar graph topology and geometric representation theory. The result has several ramifications:

• Algorithmic Implications – Knowing that a planar graph admits a segment representation informs the design of efficient drawing algorithms and layout tools used in computer graphics and network visualization.
• Structural Insight – The proof illuminated hidden constraints on how vertices can be “realized” geometrically, enriching the theory of intersection graphs and influencing subsequent work on string graphs and segment graphs.
• Pedagogical Value – The conjecture and its proof serve as a compelling case study in undergraduate and graduate courses, illustrating how a simple geometric question can lead to sophisticated combinatorial arguments.

While the source does not detail the proof’s authors, the fact that the conjecture is now proven underscores the lasting impact of Scheinerman’s original insight.

Work in Order Theory

In addition to his graph‑theoretic pursuits, Scheinerman has contributed to order theory, the branch of mathematics that studies partially ordered sets (posets) and their properties. Though specific theorems are not enumerated in the source, his dual focus on graphs and orders reflects a broader trend in combinatorics: many structural results about graphs can be re‑interpreted as statements about comparability or dimension in posets. Scheinerman’s expertise in both areas enables him to bridge techniques—such as using linear extensions of posets to construct graph representations—thereby fostering cross‑pollination between the two subfields.

Broader Influence on Graph Theory

Beyond the conjecture itself, Scheinerman’s research agenda includes topics such as random intervals, probabilistic methods in graph representation, and geometric graph theory. His collaborative paper “Random intervals” (with Joyce Justicz and Peter Winkler) examines the probabilistic behavior of interval graphs—a class of intersection graphs where vertices correspond to intervals on the real line. This work contributed to a deeper understanding of how randomness interacts with combinatorial structure, a theme that resonates throughout modern graph theory.

Expository Writing and the Lester R. Ford Awards

Scheinerman’s talent for clear, engaging exposition has been formally recognized twice by the Mathematical Association of America:

1. 1991 – “Random intervals” (co‑authored with Joyce Justicz and Peter Winkler). The paper explains probabilistic properties of interval graphs in a manner accessible to a broad mathematical audience.
2. 2001 – “When Close is Close Enough.” This article explores subtle notions of proximity in metric spaces and their combinatorial consequences, again emphasizing intuition and readability.

The Lester R. Ford Award honors authors whose expository articles appear in The American Mathematical Monthly or Mathematics Magazine and demonstrate exceptional clarity. Receiving the award twice places Scheinerman among a distinguished cohort of mathematicians who have shaped how complex ideas are communicated to students, educators, and researchers.

Professional Service and Leadership Roles

Scheinerman’s administrative trajectory at Johns Hopkins reflects a sustained commitment to institutional service:

• Department Chair (2000 onward) – Guided curricular revisions, fostered interdisciplinary collaborations, and championed faculty recruitment.
• Associate Dean & Vice Dean for Education – Played a pivotal role in aligning undergraduate curricula with evolving industry demands, especially in data science and computational modeling.
• Vice Dean for Graduate Education – Implemented policies to improve graduate student mentorship, funding, and career placement.
• Vice Dean for Faculty (effective September 2019) – Oversees faculty development initiatives, tenure processes, and diversity programs.

These positions have allowed Scheinerman to influence policy at the departmental, school, and university levels, ensuring that the mathematical sciences remain vibrant, inclusive, and responsive to emerging research frontiers.

Recognition by Professional Societies

Scheinerman’s contributions have been acknowledged by two major societies:

• 1992 – Fellow of the Institute of Combinatorics and its Applications (ICCA). Fellowship in ICCA recognizes sustained excellence in combinatorial research and service to the combinatorial community.
• 2012 – Fellow of the American Mathematical Society (AMS). AMS fellowship is awarded to members who have made outstanding contributions to the creation, exposition, advancement, communication, and application of mathematics.

These honors validate both his scholarly output and his impact on the broader mathematical ecosystem.

Why Scheinerman Matters to the Mathematical Community

1. Foundational Insight – The resolution of Scheinerman’s conjecture linked planar graph topology to geometric representation, a bridge that continues to inspire new research directions.
2. Pedagogical Influence – His award‑winning expository articles serve as model texts for teaching probability, geometry, and combinatorics, helping students develop intuition for abstract concepts.
3. Leadership in Education – Through his administrative roles, Scheinerman has shaped curricula that integrate applied mathematics, statistics, and computer science—preparing graduates for interdisciplinary careers.
4. Community Service – Fellowship in ICCA and AMS, along with his service record, demonstrates a commitment to nurturing the combinatorial community, organizing conferences, and mentoring early‑career researchers.

Collectively, these facets illustrate a career that blends deep theoretical contributions with a dedication to education and service—a profile that resonates with institutions like Apiary, which values interdisciplinary collaboration and responsible stewardship of knowledge.

Conclusion

Edward R. Scheinerman stands as a quintessential example of a mathematician whose work transcends narrow specialization. From the elegant geometric insight encapsulated in his eponymous conjecture to his award‑winning expository prose, Scheinerman has left an indelible mark on graph theory, order theory, and the culture of mathematical communication. His long tenure at Johns Hopkins University, marked by progressive leadership roles, underscores a parallel commitment to shaping the next generation of scholars.

For students, researchers, and educators exploring the rich interplay between geometry and combinatorics, Scheinerman’s body of work offers both a roadmap and an inspiration. As the mathematical community continues to probe the frontiers of graph representations, the legacy of Scheinerman’s conjecture—and his broader scholarly ethos—will remain a guiding beacon.

FAQ

What is Scheinerman’s conjecture? Scheinerman’s conjecture states that every planar graph can be represented as an intersection graph of line segments; the conjecture has since been proved.

Which universities did Ed Scheinerman attend for his undergraduate and graduate studies? He earned his bachelor’s degree at Brown University (graduated 1980) and his Ph.D. at Princeton University (earned 1984).

How many times has Scheinerman won the MAA Lester R. Ford Award, and for which papers? He has won the award twice: in 1991 for “Random intervals” (with Joyce Justicz and Peter Winkler) and in 2001 for “When Close is Close Enough.”

When did Scheinerman become a fellow of the American Mathematical Society? He was elected a fellow of the American Mathematical Society in 2012.

What administrative positions has Scheinerman held at Johns Hopkins University? Since 2000, he has served as department chair, associate dean, vice dean for education, vice dean for graduate education, and, beginning September 2019, vice dean for faculty.