An upper bound for the transversal numbers of 4-uniform hypergraphs
From MaRDI portal
Publication:1813333
DOI10.1016/0095-8956(90)90101-5zbMath0739.05068OpenAlexW1991535450MaRDI QIDQ1813333
Feng-Chu Lai, Gerard Jennhwa Chang
Publication date: 25 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(90)90101-5
Related Items (42)
A characterization of hypergraphs with large domination number ⋮ Transversals and independence in linear hypergraphs with maximum degree two ⋮ Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs ⋮ What we know and what we do not know about Turán numbers ⋮ The algorithmic complexity of the minus clique-transversal problem ⋮ The largest transversal numbers of uniform hypergraphs ⋮ Clique-transversal number of graphs whose clique-graphs are trees ⋮ Minimum size transversals in uniform hypergraphs ⋮ A new lower bound on the independence number of a graph and applications ⋮ Total transversals and total domination in uniform hypergraphs ⋮ Upper transversals in hypergraphs ⋮ On the transversal number of rank \(k\) hypergraphs ⋮ On the transversal number of \(k\)-uniform connected hypergraphs ⋮ Extremal hypergraphs for matching number and domination number ⋮ Independence in 5-uniform hypergraphs ⋮ Transversals in regular uniform hypergraphs ⋮ The Tuza–Vestergaard Theorem ⋮ Hypergraphs with large transversal number and with edge sizes at least four ⋮ A note on the Tuza constant \(c_k\) for small \(k\) ⋮ Unnamed Item ⋮ A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem ⋮ Linear hypergraphs with large transversal number and maximum degree two ⋮ Transversals and domination in uniform hypergraphs ⋮ A note on improved upper bounds on the transversal number of hypergraphs ⋮ Covering all cliques of a graph ⋮ Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs ⋮ Lower bounds on Tuza constants for transversals in linear uniform hypergraphs ⋮ Bounds on the clique-transversal number of regular graphs ⋮ Total domination of graphs and small transversals of hypergraphs ⋮ Signed clique-transversal functions in graphs ⋮ Transversals in 4-uniform hypergraphs ⋮ Bounds on upper transversals in hypergraphs ⋮ Domination and matching in power and generalized power hypergraphs ⋮ A new upper bound on the total domination number in graphs with minimum degree six ⋮ Affine planes and transversals in 3-uniform linear hypergraphs ⋮ Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs ⋮ Domination and Total Domination in Hypergraphs ⋮ Transversal numbers of uniform hypergraphs ⋮ The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 ⋮ Matching criticality in intersecting hypergraphs ⋮ Total Transversals in Hypergraphs and Their Applications ⋮ A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size
Cites Work
This page was built for publication: An upper bound for the transversal numbers of 4-uniform hypergraphs
