Pages that link to "Item:Q4237730"

The following pages link to A lower bound on the independence number of arbitrary hypergraphs (Q4237730):

Displaying 11 items.

• Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
• Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs (Q298341) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• Interpolating between bounds on the independence number (Q708394) (← links)
• Lower bounds for constant degree independent sets (Q1322210) (← links)
• A lower bound on the independence number of a graph (Q1584341) (← links)
• Coloring the normalized Laplacian for oriented hypergraphs (Q1979369) (← links)
• New results on \(k\)-independence of hypergraphs (Q2689120) (← links)
• On Subgraphs of Bounded Degeneracy in Hypergraphs (Q3181066) (← links)
• The potential of greed for independence (Q4650180) (← links)
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)