Invitation to intersection problems for finite sets (Q739389)

scientific article; zbMATH DE number 6617988

Language	Label	Description	Also known as
English	Invitation to intersection problems for finite sets	scientific article; zbMATH DE number 6617988

Statements

instance of

scholarly article

0 references

title

Invitation to intersection problems for finite sets (English)

0 references

0 references

0 references

Journal of Combinatorial Theory. Series A

0 references

publication date

18 August 2016

0 references

zbMATH Keywords

extremal set theory

0 references

intersection problems

0 references

shadow and shifting

0 references

independence number

0 references

matching number

0 references

covering number

0 references

L-systems

0 references

semidefinite programming

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.jcta.2016.06.017

0 references

cites work

The complete nontrivial-intersection theorem for systems of finite sets

0 references

The complete intersection theorem for systems of finite sets

0 references

A pushing-pulling method: New proofs of intersection theorems

0 references

Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems

0 references

Q2754178

0 references

The probabilistic method. With an appendix on the life and work of Paul Erdős.

0 references

Intersection theorems and a lemma of Kleitman

0 references

Set systems with restricted intersections modulo prime powers

0 references

Q4945051

0 references

A Hilton-Milner theorem for vector spaces

0 references

Q3726125

0 references

SETS OF INDEPENDENT EDGES OF A HYPERGRAPH

0 references

Intersecting families of sets and permutations: a survey

0 references

The maximum product of sizes of cross-$t$-intersecting uniform families

0 references

The maximum product of weights of cross-intersecting families

0 references

A finite set covering theorem

0 references

Intersecting families of permutations

0 references

Improved bounds on families under $k$-wise set-intersection constraints

0 references

Families of Sets with Intersecting Clusters

0 references

Shadows and intersections in vector spaces

0 references

An Extremal Set-Intersection Theorem

0 references

Removal and stability for Erdős-Ko-Rado

0 references

A simple proof of the Kruskal-Katona theorem

0 references

Sets of finite sets satisfying union conditions

0 references

The Number of Values of a Boolean Function

0 references

Q5707657

0 references

Intersection Properties of Systems of Finite Sets

0 references

Intersecting Families are Essentially Contained in Juntas

0 references

Q3792687

0 references

Forbidding just one intersection, for permutations

0 references

Triangle-intersecting families of graphs

0 references

Intersecting families of permutations

0 references

Stability versions of Erdős-Ko-Rado type theorems via isoperimetry

0 references

Q4338928

0 references

Q5510578

0 references

On the combinatorial problems which I would most like to see solved

0 references

Q3760478

0 references

On maximal paths and circuits of graphs

0 references

Extremal problems among subsets of a set

0 references

INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

0 references

Q4074927

0 references

Probabilities for Intersecting Systems and Random Subsets of Finite Sets

0 references

The proof of a conjecture of G. O. H. Katona

0 references

On Sperner families satisfying an additional condition

0 references

Q4871772

0 references

Q4184835

0 references

On intersecting families of finite sets

0 references

On intersecting families of finite sets

0 references

On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex

0 references

Constructing Finite Sets With Given Intersections

0 references

All rationals occur as exponents

0 references

Q3770569

0 references

A lower bound on the size of a complex generated by an antichain

0 references

Multiply-intersecting families

0 references

Shadows and shifting

0 references

On the maximum number of edges in a hypergraph with given matching number

0 references

Improved bounds for Erdős' matching conjecture

0 references

A new generalization of the Erdős-Ko-Rado theorem

0 references

On hypergraphs without two edges intersecting in a given number of vertices

0 references

Forbidding just one intersection

0 references

Exact solution of some Turán-type problems

0 references

Beyond the Erdős-Ko-Rado theorem

0 references

A new short proof of the EKR theorem

0 references

On matchings in hypergraphs

0 references

An Erdős-Ko-Rado theorem for cross $t$-intersecting families

0 references

Minimum shadows in uniform hypergraphs and a generalization of the Takagi function

0 references

Uniform intersecting families with covering number four

0 references

Covers in uniform intersecting families and a counterexample to a conjecture of Lovász

0 references

Exponents of uniform $L$-systems

0 references

Near perfect coverings in graphs and hypergraphs

0 references

Forbidden Intersections

0 references

Some best possible inequalities concerning cross-intersecting families

0 references

On <i>r</i>-Cross Intersecting Families of Sets

0 references

Uniform eventown problems

0 references

Intersection theorems with geometric consequences

0 references

The Erdős-Ko-Rado theorem for vector spaces

0 references

On the measure of intersecting families, uniqueness and stability

0 references

Covers in 5-uniform intersecting families with covering number three

0 references

On finite set-systems whose every intersection is a kernel of a star

0 references

Matchings and covers in hypergraphs

0 references

Q3348932

0 references

Erdős–Ko–Rado Theorems: Algebraic Approaches

0 references

Q2716030

0 references

Q4196436

0 references

Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs

0 references

Optimal numberings and isoperimetric problems on graphs

0 references

SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

0 references

The size of a hypergraph and its matching number

0 references

A proof of Alon-Babai-Suzuki's conjecture and multilinear polynomials

0 references

Q4255576

0 references

On a Problem of Erdos and Lovasz. II: n(r) = O(r)

0 references

Intersection theorems for systems of finite sets

0 references

Q4071752

0 references

Q4052170

0 references

Shadows and intersections: Stability and new proofs

0 references

Q3089368

0 references

Frankl-Rödl-type theorems for codes and permutations

0 references

Families of Non-disjoint subsets

0 references

On subsets containing a family of non-commensurable subsets of a finite set

0 references

Maximal number of subsets of a finite set No k of which are pairwise disjoint

0 references

A note on the stability number of an orthogonality graph

0 references

Q5726070

0 references

Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers

0 references

Stable sets of maximal size in Kneser-type graphs

0 references

Q3201059

0 references

Non $t$-intersecting families of linear spaces over $GF(q)$

0 references

Q4180391

0 references

On the Shannon capacity of a graph

0 references

Differences of Sets and A Problem of Graham

0 references

A generalization of the Katona theorem for cross t-intersecting families

0 references

An analogue of the Erdoes-Ko-Rado theorem for the Hamming schemes H(n,q)

0 references

Erdős--Ko--Rado for three sets

0 references

Specified intersections

0 references

Proof of a conjecture of Erdős on triangles in set-systems

0 references

Cross-intersecting families of vectors

0 references

Asymptotic behavior of the chromatic index for hypergraphs

0 references

On t-designs

0 references

On a packing and covering problem

0 references

A note on a conjecture by Füredi

0 references

New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming

0 references

On incomparable collections of sets

0 references

The maximum size of intersecting and union families of sets

0 references

A sharp bound for the number of sets that pairwise intersect at $k$ positive values

0 references

A cross-intersection theorem for vector spaces based on semidefinite programming

0 references

A semidefinite programming approach to a cross-intersection problem with measures

0 references

Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs

0 references

Antipodal sets in oriented real Grassmann manifolds

0 references

Estimates of antipodal sets in oriented real Grassmann manifolds

0 references

Semidefinite optimization

0 references

An $L$-system on the small Witt design

0 references

Q3509408

0 references

The eigenvalue method for cross $t$-intersecting families

0 references

Cross $t$-intersecting integer sequences from weighted Erdős-Ko-Rado

0 references

On systems of finite sets with constraints on their unions and intersections

0 references

Nontrivial independent sets of bipartite graphs and cross-intersecting families

0 references

The exact bound in the Erdős-Ko-Rado theorem

0 references

Identifiers

zbMATH Open document ID

1343.05153

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.JCTA.2016.06.017

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:739389