A sharp upper bound for the transversal number of k-uniform connected hypergraphs with given size
From MaRDI portal
Publication:2111206
DOI10.1007/S10878-022-00968-6OpenAlexW4312105941MaRDI QIDQ2111206FDOQ2111206
Publication date: 28 December 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00968-6
Recommendations
Cites Work
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Title not available (Why is that?)
- Total domination of graphs and small transversals of hypergraphs
- An upper bound for the transversal numbers of 4-uniform hypergraphs
- Hypergraphs with large transversal number and with edge sizes at least four
- Hypergraphs with large transversal number
- Linear hypergraphs with large transversal number and maximum degree two
- Transversals and matchings in 3-uniform hypergraphs
- Title not available (Why is that?)
- Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Covering triangles in edge-weighted graphs
- On the vertex cover number of 3-uniform hypergraph
- Title not available (Why is that?)
Cited In (4)
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)
