Pages that link to "Item:Q3970967"

The following pages link to Improved lower bounds on <i>k</i>‐independence (Q3970967):

Displaying 40 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
• Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
• Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
• On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
• On vertex independence number of uniform hypergraphs (Q399512) (← links)
• New results on \(k\)-independence of graphs (Q528993) (← links)
• \(k\)-domination and \(k\)-independence in graphs: A survey (Q659765) (← links)
• Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
• Independent \((k + 1)\)-domination in \(k\)-trees (Q777366) (← links)
• Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs (Q845699) (← links)
• Independence in 5-uniform hypergraphs (Q898167) (← links)
• A polynomial algorithm for constructing families of k-independent sets (Q920998) (← links)
• Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
• Independent sets in bounded-degree hypergraphs (Q1026137) (← links)
• Covering the cliques of a graph with vertices (Q1201260) (← links)
• A probabilistic lower bound on the independence number of graphs (Q1336674) (← links)
• Independence numbers of hypergraphs with sparse neighborhoods. (Q1427433) (← links)
• An extension of Kemperman's characterization on \(k\)-independence and its application (Q1645172) (← links)
• On approximation of the vertex cover problem in hypergraphs (Q1779691) (← links)
• Mixed domination and 2-independence in trees (Q2132130) (← links)
• MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
• Partitions of graphs into small and large sets (Q2446835) (← links)
• On a polynomial fractional formulation for independence number of a graph (Q2457911) (← links)
• New results on \(k\)-independence of hypergraphs (Q2689120) (← links)
• On Subgraphs of Bounded Degeneracy in Hypergraphs (Q3181066) (← links)
• Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088) (← links)
• Partial Resampling to Approximate Covering Integer Programs (Q4575724) (← links)
• The potential of greed for independence (Q4650180) (← links)
• On the Independence Number of Steiner Systems (Q4911171) (← links)
• Extremal problems in hypergraph colourings (Q5112450) (← links)
• 3-Hitting set on bounded degree hypergraphs: Upper and lower bounds on the kernel size (Q5261045) (← links)
• Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
• Conjecture of TxGraffiti: Independence, domination, and matchings (Q5869457) (← links)
• Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
• The <i>k</i>‐path vertex cover: General bounds and chordal graphs (Q6087563) (← links)
• Choice functions (Q6105041) (← links)
• Automated category tree construction: hardness bounds and algorithms (Q6572611) (← links)
• New lower bounds for \(t\)-coverings (Q6573098) (← links)
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
• \(H\)-factors in graphs with small independence number (Q6615761) (← links)