Pages that link to "Item:Q1179466"
From MaRDI portal
The following pages link to Extensions of Gallai's graph covering theorems for uniform hypergraphs (Q1179466):
Displaying 21 items.
- A note on the duality between matchings and vertex covers in balanced hypergraphs (Q306113) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Complexity and approximation of the constrained forest problem (Q553340) (← links)
- Gallai theorems for graphs, hypergraphs, and set systems (Q804601) (← links)
- An extension of matching theory (Q1057288) (← links)
- t-expansive and t-wise intersecting hypergraphs (Q1076693) (← links)
- Extension of a clique cover result to uniform hypergraphs (Q1078579) (← links)
- Improved bounds for covering complete uniform hypergraphs (Q1190514) (← links)
- Inequalities for minimal covering sets in set systems of given rank (Q1329820) (← links)
- On covering numbers of regular hypergraphs (Q1369334) (← links)
- An Erdős-Gallai type theorem for uniform hypergraphs (Q1686258) (← links)
- On a problem of Erdős and Moser (Q1688260) (← links)
- The behavior of depth functions of cover ideals of unimodular hypergraphs (Q1688613) (← links)
- A generalisation of matching and colouring (Q1877669) (← links)
- Covering and independence in triangle structures (Q1916100) (← links)
- On the vertex cover number of 3-uniform hypergraph (Q2240114) (← links)
- Minimal covers of infinite hypergraphs (Q2324493) (← links)
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (Q2407022) (← links)
- (Q3222235) (← links)
- (Q5233770) (← links)
- Extremal results and bounds for atom-bond sum-connectivity index (Q6562216) (← links)
