New results on \(k\)-independence of hypergraphs

DOI10.1007/s00373-022-02607-7OpenAlexW2793745936MaRDI QIDQ2689120

Lei Zhang

Publication date: 9 March 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.03393

zbMATH Keywords

\(k\)-independent set\(s\)-uniform hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• New results on \(k\)-independence of graphs
• Hypergraph theory. An introduction
• New approach to the \(k\)-independence number of a graph
• Partitions of graphs into small and large sets
• Turan's theorem for \(k\)-graphs
• Improved lower bounds on k‐independence
• A lower bound on the independence number of arbitrary hypergraphs
• New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs
• On chromatic number of finite set-systems

This page was built for publication: New results on \(k\)-independence of hypergraphs