A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
From MaRDI portal
Publication:2111206
Recommendations
Cites work
- scientific article; zbMATH DE number 3154393 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 3003740 (Why is no real title available?)
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Covering all cliques of a graph
- Covering triangles in edge-weighted graphs
- Hypergraphs with large transversal number
- Hypergraphs with large transversal number and with edge sizes at least four
- Linear hypergraphs with large transversal number and maximum degree two
- Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
- On the vertex cover number of 3-uniform hypergraph
- Small transversals in hypergraphs
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Total domination of graphs and small transversals of hypergraphs
- Transversals and matchings in 3-uniform hypergraphs
Cited in
(11)- On the transversal number of \(k\)-uniform connected hypergraphs
- On the transversal number of rank \(k\) hypergraphs
- Small transversals in hypergraphs
- On upper transversals in 3-uniform hypergraphs
- Minimum size transversals in uniform hypergraphs
- An upper bound for the transversal number of connected \(k\)-uniform hypergraphs
- Some combinatorial algorithms on the dominating number of anti-rank \(k\) hypergraphs
- Transversal coalitions in hypergraphs
- Bounds on upper transversals in hypergraphs
- A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem
- Upper transversals in hypergraphs
This page was built for publication: A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111206)
