The following pages link to (Q4180391):
Displaying 12 items.
- Color the cycles (Q383778) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Covers in partitioned intersecting hypergraphs (Q499465) (← links)
- Extremal hypergraphs for Ryser's conjecture (Q721059) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Independence-domination duality (Q958688) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- A note on a series of families constructed over the cyclic graph (Q1747761) (← links)
- Intersecting balanced families of sets (Q5930023) (← links)
- Multipartite hypergraphs achieving equality in Ryser's conjecture (Q5964971) (← links)
