Bounding the vertex cover number of a hypergraph
From MaRDI portal
Publication:1323476
DOI10.1007/BF01305948zbMath0796.05072MaRDI QIDQ1323476
Guoli Ding, P. D. Seymour, Peter M. Winkler
Publication date: 15 September 1994
Published in: Combinatorica (Search for Journal in Brave)
Related Items
Some geometric applications of Dilworth's theorem, Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements, Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs, On point covers of multiple intervals and axis-parallel rectangles, Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph, Distance-two coloring of sparse graphs, List 3-coloring graphs with no induced \(P_6 + rP_3\), Quadratic forms on graphs, On the vertex cover number of 3-uniform hypergraph, Domination in tournaments, A bijection between the \(d\)-dimensional simplices with distances in \(\{1,2\}\) and the partitions of \(d+1\), On point covers of \(c-\)oriented polygons, Bounding the number of bases of a matroid, VC-dimension and Erdős-Pósa property, Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings, Packing and covering balls in graphs excluding a minor, Fast stabbing of boxes in high dimensions, Transversal numbers for hypergraphs arising in geometry
Cites Work
- \(\epsilon\)-nets and simplex range queries
- Almost tight bounds for \(\epsilon\)-nets
- On obstructions to small face covers in planar graphs
- Distribution inequalities for the binomial law
- Notes on the Ramsey number N(3,3,3,3)
- Learnability and the Vapnik-Chervonenkis dimension
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
