New results on $k$-independence of hypergraphs

TL;DR

This paper establishes new lower bounds on the size of $k$-independent sets in hypergraphs, relating these bounds to maximum and average degrees, advancing understanding of hypergraph independence properties.

Contribution

It introduces a novel lower bound for $k$-independent set size in hypergraphs based on maximum and average degrees, extending previous results.

Findings

Derived a lower bound based on maximum degree

Proved a bound involving average degree and hypergraph parameters

Enhanced theoretical understanding of hypergraph independence

Abstract

Let $H=(V,E)$ be an $s$-uniform hypergraph of order $n$ and $k\geq 0$ be an integer. A $k$-independent set $S\subseteq H$ is a set of vertices such that the maximum degree in the hypergraph induced by $S$ is at most $k$. Denoted by $\alpha_k(H)$ the maximum cardinality of the $k$-independent set of $H$. In this paper, we first give a lower bound of $\alpha_k(H)$ by the maximum degree of $H$. Furthermore, we prove that $\alpha_k(H)\geq \frac{s(k+1)n}{2d+s(k+1)}$ where $d$ is average degree of $H$, and $k\geq 0$ is an integer.