SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
From MaRDI portal
Cited in
(only showing first 100 items - show all)- The unbalance of set systems
- A generalization of Talbot's theorem about King Arthur and his knights of the round table
- On t-intersecting families of signed sets and permutations
- The Erdős-Ko-Rado properties of various graphs containing singletons
- A short proof of a cross-intersection theorem of Hilton
- The Erdős-Ko-Rado properties of set systems defined by double partitions
- Extremal problems concerning Kneser-graphs
- Non-trivial intersecting families
- A generalization of a theorem of Kruskal
- On the representing number of intersecting families
- Finite projective spaces and intersecting hypergraphs
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- The complexity of multicolouring
- On automorphisms of line-graphs
- On Sperner families in which no k sets have an empty intersection. III
- Some best possible inequalities concerning cross-intersecting families
- A general framework for discovering and proving theorems of the Erdős- Ko-Rado type
- Intersection theorems for systems of finite vector spaces
- Equipartite colorings in graphs and hypergraphs
- Set colourings of graphs
- Maximal \(s\)-wise \(t\)-intersecting families of sets: Kernels, generating sets, and enumeration
- On conjectures of Berge and Chvátal
- Non-empty cross-2-intersecting families of subsets
- Largest size and union of Helly families
- The order dimension of two levels of the Boolean lattices
- Circular chromatic number of Kneser graphs
- Some results on intersecting families of subsets
- Graph products and the chromatic difference sequence of vertex-transitive graphs
- The multichromatic numbers of some Kneser graphs
- Boolean functions: influence, threshold and noise
- Domination in intersecting hypergraphs
- The Hilton-Milner theorem for finite affine spaces
- Two extremal problems on intersecting families
- Short proofs of the Kneser-Lovász coloring principle
- Diversity of uniform intersecting families
- Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs
- Regular bipartite graphs and intersecting families
- A degree version of the Hilton-Milner theorem
- Families with no matchings of size s
- Erdös-Ko-Rado theorems for a family of trees
- Non-trivially intersecting multi-part families
- On the random version of the Erdős matching conjecture
- Independence number of products of Kneser graphs
- The chromatic number of the q-Kneser graph for large q
- New injective proofs of the Erdős-Ko-Rado and Hilton-Milner theorems
- Colourings without monochromatic disjoint pairs
- \(k\)-tuple colorings of the Cartesian product of graphs
- The Cayley isomorphism property for Cayley maps
- Coloring cross-intersecting families
- The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- Matchings and covers in hypergraphs
- The number of k-intersections of an intersecting family of r-sets
- Stable sets of maximal size in Kneser-type graphs
- NP-completeness of a family of graph-colouring problems
- Extremal problems among subsets of a set
- Erdős-Ko-Rado from Kruskal-Katona
- Covering by intersecting families
- Uniform intersecting families with covering number four
- Cross-intersecting families of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- Sharp results concerning disjoint cross-intersecting families
- On symmetric intersecting families
- The Hilton-Milner theorem for attenuated spaces
- Refuting conjectures in extremal combinatorics via linear programming
- On non-trivial families without a perfect matching
- Set systems with positive intersection sizes
- Erdős-Ko-Rado theorems on the weak Bruhat lattice
- Old and new applications of Katona's circle
- The toughness of Kneser graphs
- On the arithmetic mean of the size of cross-union families
- The structure of large non-trivial \(t\)-intersecting families of finite sets
- On strengthenings of the intersecting shadow theorem
- Kruskal-Katona function and variants of cross-intersecting antichains
- On the chromatic number of two generalized Kneser graphs
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs
- On the maximum number of distinct intersections in an intersecting family
- Best possible bounds on the number of distinct differences in intersecting families
- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
- Stability on matchings in 3-uniform hypergraphs
- Size and structure of large \((s,t)\)-union intersecting families
- Clique number of Xor products of Kneser graphs
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- Sharp bounds for the chromatic number of random Kneser graphs
- On intersecting families of independent sets in trees
- Erdős-Ko-Rado theorem for a restricted universe
- Cross-intersecting subfamilies of levels of hereditary families
- On the number of distinct differences in an intersecting family
- Non-trivial \(d\)-wise intersecting families
- On the size of shadow-added intersecting families
- Analogues of Milner's theorem for families without long chains and of vector spaces
- On the tractability of ( k , i )-coloring
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
- Intersecting families of discrete structures are typically trivial
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry
- The EKR property for flag pure simplicial complexes without boundary
- Classification of maximum hittings by large families
- Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman
- Degree versions of theorems on intersecting families via stability
This page was built for publication: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554997)