Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Fractional Graph Theory: A Rational Approach to the Theory of Graphs

- Edward R. Scheinerman, Daniel H. Ullman
- Mathematics
- 8 September 1997

General Theory: Hypergraphs. Fractional Matching. Fractional Coloring. Fractional Edge Coloring. Fractional Arboricity and Matroid Methods. Fractional Isomorphism. Fractional Odds and Ends. Appendix.… Expand

338 32- PDF

On Random Intersection Graphs: The Subgraph Problem

- M. Karoński, Edward R. Scheinerman, Karen B. Singer-Cohen
- Mathematics
- 1999

A new model of random graphs – random intersection graphs – is introduced. In this model, vertices are assigned random subsets of a given set. Two vertices are adjacent provided their assigned sets… Expand

195 22

Random Dot Product Graph Models for Social Networks

- S. Young, Edward R. Scheinerman
- Mathematics, Computer Science
- WAW
- 11 December 2007

TLDR

200 19- PDF

Representations of Planar Graphs

- G. Brightwell, Edward R. Scheinerman
- Mathematics, Computer Science
- SIAM J. Discret. Math.
- 1 May 1993

TLDR

125 8

Fractional isomorphism of graphs

- M. V. Ramana, Edward R. Scheinerman, D. Ullman
- Mathematics, Computer Science
- Discret. Math.
- 15 September 1994

TLDR

49 7

Degrees of freedom versus dimension for containment orders

- N. Alon, Edward R. Scheinerman
- Mathematics
- 1 March 1988

Given a family of sets L, where the sets in L admit k ‘degrees of freedom’, we prove that not all (k+1)-dimensional posets are containment posets of sets in L. Our results depend on the following… Expand

45 7- PDF

Fractional dimension of partial orders

- G. Brightwell, Edward R. Scheinerman
- Mathematics
- 1 June 1992

Given a partially ordered setP=(X, ≤), a collection of linear extensions {L1,L2,...,Lr} is arealizer if, for every incomparable pair of elementsx andy, we havex<y in someLi (andy<x in someLj). For a… Expand

39 7

Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models

- J. Fill, Edward R. Scheinerman, Karen B. Singer-Cohen
- Mathematics
- 1 March 2000

When the random intersection graph G(n, m, p) proposed by Karonski, Scheinerman, and Singer-Cohen [Combin Probab Comput 8 (1999), 131–159] is compared with the independent-edge G(n, p), the… Expand

92 6

Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models

- J. Fill, Edward R. Scheinerman, Karen B. Singer-Cohen
- Computer Science
- Random Struct. Algorithms
- 2000

TLDR

71 6

Modeling graphs using dot product representations

- Edward R. Scheinerman, K. Tucker
- Mathematics, Computer Science
- Comput. Stat.
- 18 January 2010

TLDR

57 6