Skip to main navigation
Skip to search
Skip to main content
The Hebrew University of Jerusalem Home
Approve / Request updates on publications
Link opens in a new tab
Search content at The Hebrew University of Jerusalem
Home
Profiles
Research units
Research output
Prizes
On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph
Amnon Barak
, Paul Erdos
The Rachel and Selim Benin School of Engineering and Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On the Maximal Number of Strongly Independent Vertices in a Random Acyclic Directed Graph'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Directed Acyclic Graph
100%
Strongly Independent
100%
Independent Vertices
100%
Random Graphs
33%
Vertex Set
33%
Number of Vertices
33%
High-to-Low
33%
Directed Path
33%
Mathematics
Edge
100%
Directed Acyclic Graph
100%
Probability
100%
Directed Path
50%
Random Graphs
50%