Graph hypergraphs and digraphs Extremal Problems and Algorithms 30007648 Graph, Hypergraphs and Digraphs; Extremal Problems and Algorithms One of the cornerstones of graph theory, Diracs theorem, states that if G is a graph on n = 3 vertices with minimum degree at least n/2, then G contains a spanning cycle. In recent years there has been a lot of interest in establishing similar results fo
|Effective start/end date||9/1/17 → 8/31/24|
- Simons Foundation: $42,000.00
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.