A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\)

DOI10.1007/s00236-024-00468-6MaRDI QIDQ6658088

Zhuo Diao, Haoyang Zou, Zhongzheng Tang

Publication date: 8 January 2025

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A note on the independence number of triangle-free graphs. II
• Approximating maximum independent sets by excluding subgraphs
• Lower bounds on the independence number in terms of the degrees
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Determining the Stability Number of a Graph
• On uncrowded hypergraphs
• Rapid mixing of hypergraph independent sets
• Sharp bounds on the order, size, and stability number of graphs
• On independent sets in hypergraphs
• On the independence number of a graph in terms of order and size

This page was built for publication: A sharp lower bound on the independence number of \(k\)-regular connected hypergraphs with rank \(R\)