Pages that link to "Item:Q1813333"

The following pages link to An upper bound for the transversal numbers of 4-uniform hypergraphs (Q1813333):

Displaying 40 items.

• A characterization of hypergraphs with large domination number (Q274700) (← links)
• Minimum size transversals in uniform hypergraphs (Q394227) (← links)
• A new lower bound on the independence number of a graph and applications (Q405126) (← links)
• Total transversals and total domination in uniform hypergraphs (Q405218) (← links)
• Hypergraphs with large transversal number and with edge sizes at least four (Q424115) (← links)
• Transversals and domination in uniform hypergraphs (Q649007) (← links)
• Transversals in 4-uniform hypergraphs (Q727047) (← links)
• Distinguishing-transversal in hypergraphs and identifying open codes in cubic graphs (Q742603) (← links)
• Independence in 5-uniform hypergraphs (Q898167) (← links)
• Bounds on the clique-transversal number of regular graphs (Q943436) (← links)
• Total domination of graphs and small transversals of hypergraphs (Q949753) (← links)
• Covering all cliques of a graph (Q1174130) (← links)
• Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs (Q1637144) (← links)
• Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
• Generalized transversals, generalized vertex covers and node-fault-tolerance in graphs (Q1727753) (← links)
• Transversal numbers of uniform hypergraphs (Q1813713) (← links)
• What we know and what we do not know about Turán numbers (Q1895823) (← links)
• The largest transversal numbers of uniform hypergraphs (Q1910524) (← links)
• A new upper bound on the total domination number in graphs with minimum degree six (Q2043347) (← links)
• Affine planes and transversals in 3-uniform linear hypergraphs (Q2045381) (← links)
• A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size (Q2111206) (← links)
• Lower bounds on Tuza constants for transversals in linear uniform hypergraphs (Q2231740) (← links)
• Bounds on upper transversals in hypergraphs (Q2292129) (← links)
• Domination and matching in power and generalized power hypergraphs (Q2292152) (← links)
• Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
• The algorithmic complexity of the minus clique-transversal problem (Q2383654) (← links)
• Upper transversals in hypergraphs (Q2422208) (← links)
• A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid theorem (Q2439129) (← links)
• Linear hypergraphs with large transversal number and maximum degree two (Q2441629) (← links)
• The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489) (← links)
• Signed clique-transversal functions in graphs (Q3056375) (← links)
• Domination and Total Domination in Hypergraphs (Q3384117) (← links)
• A note on improved upper bounds on the transversal number of hypergraphs (Q4621301) (← links)
• Matching criticality in intersecting hypergraphs (Q5236049) (← links)
• Total Transversals in Hypergraphs and Their Applications (Q5251541) (← links)
• Clique-transversal number of graphs whose clique-graphs are trees (Q5320228) (← links)
• (Q5883642) (← links)
• Transversals in regular uniform hypergraphs (Q6144921) (← links)
• The Tuza–Vestergaard Theorem (Q6161262) (← links)
• A note on the Tuza constant \(c_k\) for small \(k\) (Q6184535) (← links)