182 search results - page 1 / 37 » Extremal Problems For Transversals In Graphs With Bounded De... |
90
Voted
COMBINATORICA
2006
14 years 10 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
80
Voted
SIAMCOMP
2000
14 years 10 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
84
Voted
COMBINATORICA
2007
14 years 10 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...
SODA
2012
ACM
13 years 16 days ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
GC
2002
Springer
14 years 10 months ago
2002
Springer
Let G