Concepedia

Earl S. Kramer

ES

12

Publications

394

Citations

11

H-Index

1970

Active since

Affiliations

University of Nebraska–Lincoln(Current)

Earl S. Kramer is an author at University of Nebraska–Lincoln specializing in discrete mathematics, combinatorial optimization, and graph theory.

Top concepts

Discrete MathematicsCombinatorial OptimizationDesignEngineeringGraph TheoryEducationNetwork AnalysisFormal MethodsNetwork ScienceMechanism Design

Publications per year

1970–1993

12

Publications

12

t-designs on hypergraphs

Earl S. Kramer, Dale M. Mesner · Discrete Mathematics · 1976 · 153 citations

Graph Theory, Planar Graph, Hypergraph Theory +3

Intersections among Steiner systems

Earl S. Kramer, Dale M. Mesner · Journal of Combinatorial Theory Series A · 1974 · 70 citations

Geometric Graph Theory, Network Science, Graph Theory +8

Indecomposable triple systems

Earl S. Kramer · Discrete Mathematics · 1974 · 23 citations

Indecomposable Triple Systems, Engineering, Computational Model Theory +4

The Steiner systems S(2,4,25) with nontrivial automorphism group

Earl S. Kramer, Spyros S. Magliveras, Rudolf Mathon · Discrete Mathematics · 1989 · 21 citations

Coxeter Group, Geometric Group Theory, Combinatorial Design +2

Some mutually disjoint steiner systems

Earl S. Kramer, Spyros S. Magliveras · Journal of Combinatorial Theory Series A · 1974 · 20 citations

Graph Theory, Combinatorial Design, Network Analysis +6

Rows per page

1–5 of 12