Regular intersecting families
From MaRDI portal
Publication:2334049
DOI10.1016/j.dam.2019.07.009zbMath1426.05172arXiv1709.10462OpenAlexW2963927323MaRDI QIDQ2334049
Andrey B. Kupavskii, Ferdinand Ihringer
Publication date: 6 November 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.10462
Related Items (4)
On regular 3-wise intersecting families ⋮ On stability of the independence number of a certain distance graph ⋮ Diversity ⋮ Bounds on Borsuk numbers in distance graphs of a special type
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the stability of some Erdős-Ko-Rado type results
- Set systems without a simplex or a cluster
- Covering pairs by \(q^ 2+q+1\) sets
- On the stability of the Erdős-Ko-Rado theorem
- Finite projective spaces and intersecting hypergraphs
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Maximum degree and fractional matchings in uniform hypergraphs
- On t-designs
- Regular bipartite graphs and intersecting families
- The junta method in extremal hypergraph theory and Chvátal's conjecture
- On the stability of the independence number of a random subgraph
- Intersecting families of finite sets and fixed-point-free 2-elements
- The Non-Existence of Finite Projective Planes of Order 10
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős–Ko–Rado Theorems: Algebraic Approaches
- Intersecting Families are Essentially Contained in Juntas
- Every monotone graph property has a sharp threshold
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The Nonexistence of Certain Finite Projective Planes
This page was built for publication: Regular intersecting families