On the public citation graph
Bounding the vertex cover number of a hypergraph
0 signed · 47 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1016/0095-8956(92)90040-5openalex-snapshot
On obstructions to small face covers in planar graphs
inferredcites →https://doi.org/10.1016/0097-3165(74)90060-0openalex-snapshot
Notes on the Ramsey number N(3, 3, 3, 3)
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/160985.161146openalex-snapshot
Some geometric applications of Dilworth's theorem
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1214/aop/1176995801openalex-snapshot
Distribution Inequalities for the Binomial Law
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.1996.0026openalex-snapshot
Unavoidable Minors of Large 3-Connected Binary Matroids
inferred← citeshttps://doi.org/10.1007/978-1-4614-7258-2_34openalex-snapshot
A Remark on Transversal Numbers
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_28openalex-snapshot
A Remark on Transversal Numbers
inferred← citeshttps://doi.org/10.1007/bf01200752openalex-snapshot
Bounding the number of bases of a matroid
inferred← citeshttps://doi.org/10.1007/bf01844847openalex-snapshot
On point covers of multiple intervals and axis-parallel rectangles
inferred← citeshttps://doi.org/10.1007/bf02574361openalex-snapshot
Some geometric applications of Dilworth’s theorem
inferred← citeshttps://doi.org/10.1007/bf02574389openalex-snapshot
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements
inferred← citeshttps://doi.org/10.1007/s00453-020-00754-yopenalex-snapshot
List 3-Coloring Graphs with No Induced $$P_6+rP_3$$
inferred← citeshttps://doi.org/10.1007/s00493-020-4423-3openalex-snapshot
Packing and Covering Balls in Graphs Excluding a Minor
inferred← citeshttps://doi.org/10.1007/s00493-023-00012-zopenalex-snapshot
Sunflowers in Set Systems of Bounded Dimension
inferred← citeshttps://doi.org/10.1007/s40305-019-00284-7openalex-snapshot
On the Vertex Cover Number of 3-Uniform Hypergraph
inferred← citeshttps://doi.org/10.1016/j.disc.2015.05.026openalex-snapshot
VC-dimension and Erdős–Pósa property
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.09.002openalex-snapshot
Distance-two coloring of sparse graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2005.09.003openalex-snapshot
Dominating sets in k-majority tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.02.001openalex-snapshot
Domination in transitive colorings of tournaments
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.05.001openalex-snapshot
Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings
inferred← citeshttps://doi.org/10.1016/j.jctb.2025.09.005openalex-snapshot
Induced subgraphs and tree decompositions XVI. Complete bipartite induced minors
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.01.002openalex-snapshot
Excluding disjoint Kuratowski graphs
inferred← citeshttps://doi.org/10.1016/s0196-8858(02)00003-9openalex-snapshot
Transversal numbers for hypergraphs arising in geometry
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00227-9openalex-snapshot
On point covers of c-oriented polygons
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00336-3openalex-snapshot
Fast stabbing of boxes in high dimensions
inferred← citeshttps://doi.org/10.1017/s0963548312000065openalex-snapshot
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free Graphs
inferred← citeshttps://doi.org/10.1137/21m142188xopenalex-snapshot
Twin-Width III: Max Independent Set, Min Dominating Set, and Coloring
inferred← citeshttps://doi.org/10.1137/21m1443352openalex-snapshot
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph
inferred← citeshttps://doi.org/10.1145/160985.161146openalex-snapshot
Some geometric applications of Dilworth's theorem
inferred← citeshttps://doi.org/10.1145/3196959.3196962openalex-snapshot
General and Fractional Hypertree Decompositions
inferred← citeshttps://doi.org/10.1145/3457374openalex-snapshot
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
inferred← citeshttps://doi.org/10.48550/arxiv.1107.3491openalex-snapshot
Scott's induced subdivision conjecture for maximal triangle-free graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1302.4677openalex-snapshot
Domination in transitive colorings of tournaments
inferred← citeshttps://doi.org/10.48550/arxiv.1611.01090openalex-snapshot
General and Fractional Hypertree Decompositions: Hard and Easy Cases
inferred← citeshttps://doi.org/10.48550/arxiv.2108.07984openalex-snapshot
Bounding the edge cover of a hypergraph
inferred← citeshttps://doi.org/10.70675/32d95afcz2181z4f21z9db9z03c282405e87openalex-snapshot
Hitting sets : VC-dimension and Multicut
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.