Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
type: Item
instance of: scholarly article
title: Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs
zbMATH Open document ID: 1402.05162
author: Fang Tian
author: Zi-Long Liu
published in: Graphs and Combinatorics
publication date: 2019-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 7000603
zbMATH Keywords: \(k\)-uniform hypergraph
zbMATH Keywords: \((n, k, \ell, \lambda)\)-hypergraph
zbMATH Keywords: linear and triangle-free hypergraph
zbMATH Keywords: independent set
zbMATH Keywords: random \(k\)-uniform hypergraph
MaRDI profile type: Publication
full work available at URL: s00373-018-1911-y
OpenAlex ID: W2810574275
cites work: A note on Ramsey numbers
cites work: Q3411976
cites work: Adversarial resilience of matchings in bipartite random graphs
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: On chromatic number of graphs and set-systems
cites work: Q5625197
cites work: On the Independence Number of Steiner Systems
cites work: Probabilistic methods for algorithmic discrete mathematics
cites work: Reducibility among Combinatorial Problems
cites work: Counting designs
cites work: On independent sets in hypergraphs
cites work: Q3027024
cites work: Note on independent sets in steiner systems
cites work: A note on the independence number of triangle-free graphs
DOI: 10.1007/S00373-018-1911-Y
description: scientific article; zbMATH DE number 7000603