Pages that link to "Item:Q4908832"

The following pages link to Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three (Q4908832):

Displaying 3 items.

• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• A sharp upper bound for the transversal number of \(k\)-uniform connected hypergraphs with given size (Q2111206) (← links)
• Linear hypergraphs with large transversal number and maximum degree two (Q2441629) (← links)