Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs

DOI10.1007/s00373-018-1911-yzbMath1402.05162OpenAlexW2810574275MaRDI QIDQ1756034

Zi-Long Liu, Fang Tian

Publication date: 11 January 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-018-1911-y

zbMATH Keywords

independent set\(k\)-uniform hypergraphrandom \(k\)-uniform hypergraph\((n, k, \ell, \lambda)\)-hypergraphlinear and triangle-free hypergraph

Mathematics Subject Classification ID

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

Related Items (3)

Independent sets in hypergraphs omitting an intersection ⋮ Independence number of hypergraphs under degree conditions ⋮ Access balancing in storage systems by labeling partial Steiner systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adversarial resilience of matchings in bipartite random graphs
• A note on the independence number of triangle-free graphs
• A note on Ramsey numbers
• Probabilistic methods for algorithmic discrete mathematics
• Counting designs
• Note on independent sets in steiner systems
• On the Independence Number of Steiner Systems
• Reducibility among Combinatorial Problems
• On independent sets in hypergraphs
• On chromatic number of graphs and set-systems
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs