Improved lower bounds on k‐independence
From MaRDI portal
Publication:3970967
Recommendations
- An improved lower bound on the independence number of a graph
- scientific article; zbMATH DE number 866059
- An improvement on the maximum number of k-dominating independent sets
- A probabilistic lower bound on the independence number of graphs
- scientific article; zbMATH DE number 7651029
- A new lower bound on the independence number of graphs
- scientific article; zbMATH DE number 1112370
- A lower bound on independence in terms of degrees
- A new lower bound on the independence number of a graph and applications
- New results on \(k\)-independence of graphs
Cited in
(49)- Independent sets in bounded-degree hypergraphs
- Covering the cliques of a graph with vertices
- A probabilistic lower bound on the independence number of graphs
- Independence numbers of hypergraphs with sparse neighborhoods.
- An extension of Kemperman's characterization on k-independence and its application
- On approximation of the vertex cover problem in hypergraphs
- Mixed domination and 2-independence in trees
- MAX for \(k\)-independence in multigraphs
- Partitions of graphs into small and large sets
- On a polynomial fractional formulation for independence number of a graph
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
- New results on \(k\)-independence of hypergraphs
- Independence in uniform linear triangle-free hypergraphs
- On subgraphs of bounded degeneracy in hypergraphs
- Streaming algorithms for independent sets in sparse hypergraphs
- An algorithm for finding the independence number of a recursively generated hypergraph
- On the k-residue of disjoint unions of graphs with applications to k-independence
- On vertex independence number of uniform hypergraphs
- Linear-Time Approximation Algorithms for the Max Cut Problem
- The potential of greed for independence
- Lower bounds on the size of maximum independent sets and matchings in hypergraphs of rank three
- On the independence number of Steiner systems
- Extremal problems in hypergraph colourings
- 3-hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
- New results on \(k\)-independence of graphs
- Differential Methods for Finding Independent Sets in Hypergraphs
- Constructing test functions for global optimization using continuous formulations of graph problems
- Conjectures of TxGraffiti: independence, domination, and matchings
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth
- The k‐path vertex cover: General bounds and chordal graphs
- Choice functions
- Automated category tree construction: hardness bounds and algorithms
- New lower bounds for \(t\)-coverings
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- H-factors in graphs with small independence number
- A sharp lower bound on the independence number of k-regular connected hypergraphs with rank R
- Generalising Fisher's inequality to coverings and packings
- When entropy meets Turán: new proofs and hypergraph Turán results
- On the approximability of graph visibility problems
- Independent sets in hypergraphs
- On the approximability of graph visibility problems
- Independence polynomials of 2-step nilpotent Lie algebras
- Combinatorics. Abstracts from the workshop held January 4--9, 2026
- Independent (k + 1)-domination in k-trees
- Finding and counting cliques and independent sets in \(r\)-uniform hypergraphs
- Independence in 5-uniform hypergraphs
- A polynomial algorithm for constructing families of k-independent sets
- Linear kernelizations for restricted 3-Hitting Set problems
This page was built for publication: Improved lower bounds on k‐independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970967)
