On the Independence Number of Steiner Systems (original) (raw)
Related papers
Near Optimal Bounds for Steiner Trees in the Hypercube
SIAM Journal on Computing, 2011
On independent sets in hypergraphs
Random Structures & Algorithms, 2014
A Construction of Almost Steiner Systems
Journal of Combinatorial Designs, 2013
Strong Ramsey theorems for Steiner systems
Transactions of the American Mathematical Society, 1987
Graph-theoretic perspective on a special class of Steiner Systems
Eprint Arxiv 1410 5855, 2014
Applying a result of Frankl and Rödl to the construction of Steiner trees in the hypercube
Discrete Mathematics, 1994
THE SHARPE BOUND STEINER NUMBER IN SOME CLASSES OF GRAPHS
IAEME Publications, 2017
Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
Combinatorics, Probability and Computing, 2017
Independent sets in Steiner triple systems
Ars Combinatoria, 2004
Counting Independent Sets in Hypergraphs
Combinatorics, Probability and Computing, 2014
Mathematica Slovaca, 2009
Approximate Steiner (r − 1, r, n)‐systems without three blocks on r + 2 points
Journal of Combinatorial Designs, 2019
An Erdős–Gallai type theorem for uniform hypergraphs
European Journal of Combinatorics
The de Bruijn-Erdos Theorem for hypergraphs
2010
Mathematical Programming, 2003
Asymptotic enumeration of non-uniform linear hypergraphs
Discussiones Mathematicae Graph Theory, 2019
Discrete Mathematics, 2002
On Randomly Generated Intersecting Hypergraphs
The Electronic Journal of Combinatorics
A note on the edge cover number and independence number in hypergraphs
Discrete Mathematics, 2008
2004
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size
Combinatorics Probability and Computing
On hypergraphs without two edges intersecting in a given number of vertices
Journal of Combinatorial Theory, Series A, 1984
C O ] 6 S ep 2 01 7 3-uniform hypergraphs and linear cycles
2018
Uniformity thresholds for the asymptotic size of extremal Berge- F -free hypergraphs
Electronic Notes in Discrete Mathematics, 2017
Independence and matchings in σ-hypergraphs
Australas. J Comb., 2015
Independent Sets in Semi-random Hypergraphs
Lecture Notes in Computer Science, 2021
Hypergraphs with independent neighborhoods
Combinatorica, 2010
The steiner problem in the hypercube
Networks, 1992
On the k-independence number of graphs
Discrete Mathematics, 2019
The Forcing Edge Steiner Number of a Graph
International journal of pure and applied mathematics, 2018
On the independence number in K1, r+1-free graphs
Discrete Mathematics, 1995
On a More General Characterisation of Steiner Systems
Designs, Codes and Cryptography, 2005
On the rectilinear crossing number of complete uniform hypergraphs
2017