The following pages link to (Q3218168):
Displaying 18 items.
- Covers in partitioned intersecting hypergraphs (Q499465) (← links)
- Extremal hypergraphs for Ryser's conjecture (Q721059) (← links)
- On Ryser's conjecture for linear intersecting multipartite hypergraphs (Q730257) (← links)
- A comment on Ryser's conjecture for intersecting hypergraphs (Q1043791) (← links)
- Estimates of the independence number of a hypergraph and the Ryser conjecture (Q1274066) (← links)
- Monochromatic coverings and tree Ramsey numbers (Q1322294) (← links)
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four (Q1756039) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Small edge sets meeting all triangles of a graph (Q1926043) (← links)
- Generalizations and strengthenings of Ryser's conjecture (Q2121724) (← links)
- Ryser's conjecture for \(t\)-intersecting hypergraphs (Q2221906) (← links)
- Domination and matching in power and generalized power hypergraphs (Q2292152) (← links)
- The feasible matching problem (Q2376094) (← links)
- Matching and domination numbers in \(r\)-uniform hypergraphs (Q2410114) (← links)
- Coverings and matchings in \(r\)-partite hypergraphs (Q2913952) (← links)
- Intersecting extremal constructions in Ryser's Conjecture for r-partite hypergraphs (Q4604126) (← links)
- Nonintersecting Ryser Hypergraphs (Q5210906) (← links)
- Covering random graphs with monochromatic trees (Q6074874) (← links)