ASCEND
BY NTHRYS

NTHRYS › PhD Assistance › Combinatorics Graph Theory

Combinatorics Graph Theory

Field
▾
Category
▾

Combinatorics Graph Theory

Select a category to explore research frontiers

Loading categories...

Research Frontiers in Hypergraph Matching and Covering Problems

Develops algorithms and bounds for matching, covering, and packing problems in hypergraphs using LP relaxations.

Fractional Matching in Dense Hypergraph Systems
Algorithmic Barriers in Approximate Hypergraph Covering
Threshold Phenomena in Random Hypergraph Matchings
Matching Polytopes and Their Hidden Symmetries
Extremal Hypergraph Structures via Covering Constraints
Distributed Matching Algorithms in Hypergraph Networks
Spectral Methods for Hypergraph Decomposition Problems
Online Matching in Dynamic Hypergraph Environments
Approximation Hardness of Hypergraph Packing Problems
Stabbing Numbers and Piercing Complexity in Hypergraphs

All Combinatorics & Graph Theory PhD categories