Bounding the Independence Number in Some (n,k,ℓ,λ)-Hypergraphs

Given positive integers k , ℓ and λ such that 2 ⩽ ℓ ⩽ k - 1 , an ( n , k , ℓ , λ ) -hypergraph H is a k -uniform hypergraph on the vertex set [ n ] in which every subset of size ℓ is contained in at most λ edges. The independence number α ( H ) of H is the maximum size of a subset of vertices which...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2018-09, Vol.34 (5), p.845-861
Hauptverfasser:	Tian, Fang, Liu, Zi-Long
Format:	Artikel
Sprache:	eng
Schlagworte:	Combinatorics Engineering Design Graph theory Graphs Integers Mathematics Mathematics and Statistics Numbers Original Paper Upper bounds
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!