The following pages link to Forbidding just one intersection (Q1062676):
Displaying 50 items.
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- Independence numbers of random subgraphs of distance graphs (Q325669) (← links)
- On the stability of some Erdős-Ko-Rado type results (Q507514) (← links)
- Set families with a forbidden pattern (Q518191) (← links)
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters (Q640838) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- Pairwise intersections and forbidden configurations (Q850074) (← links)
- Scalable wake-up of multi-channel single-hop radio networks (Q906382) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
- Intersection theorems for vector spaces (Q1065892) (← links)
- All rationals occur as exponents (Q1082340) (← links)
- Codes with given distances (Q1094390) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Distributed broadcast in radio networks of unknown topology. (Q1401336) (← links)
- A tale of stars and cliques (Q1671776) (← links)
- Loose Hamiltonian cycles forced by large \((k-2)\)-degree -- sharp version (Q1689892) (← links)
- Communication and location discovery in geometric ring networks (Q1740645) (← links)
- The smallest eigenvalues of Hamming graphs, Johnson graphs and other distance-regular graphs with classical parameters (Q1791705) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Disjoint pairs in set systems with restricted intersection (Q2011127) (← links)
- Hypergraphs without exponents (Q2049452) (← links)
- New Turán type bounds for Johnson graphs (Q2068827) (← links)
- Minimum degree thresholds for Hamilton \((k/2)\)-cycles in \(k\)-uniform hypergraphs (Q2072182) (← links)
- Spectrum of Johnson graphs (Q2111919) (← links)
- On the minimal number of edges in induced subgraphs of special distance graphs (Q2150630) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Non-trivial \(d\)-wise intersecting families (Q2221841) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Estimate of the number of edges in subgraphs of a Johnson graph (Q2246879) (← links)
- On threshold probability for the stability of independent sets in distance graphs (Q2282860) (← links)
- Codegree threshold for tiling \(k\)-graphs with two edges sharing exactly \(\ell\) vertices (Q2287773) (← links)
- Chromatic numbers of Kneser-type graphs (Q2299637) (← links)
- On the chromatic number of random subgraphs of a certain distance graph (Q2322889) (← links)
- An intersection theorem for four sets (Q2383002) (← links)
- Erdős-Ko-Rado theorems in certain semilattices (Q2441154) (← links)
- Forbidding a set difference of size 1 (Q2449075) (← links)
- Forbidding just one intersection, for permutations (Q2452427) (← links)
- Linear trees in uniform hypergraphs (Q2509754) (← links)
- Approximation by juntas in the symmetric group, and forbidden intersection problems (Q2671454) (← links)
- Unavoidable subhypergraphs: a-clusters (Q2851439) (← links)
- Specified intersections (Q2862137) (← links)
- Forbidden Intersections (Q3751579) (← links)
- Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers (Q4796016) (← links)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← links)
- Turán numbers of sunflowers (Q5060342) (← links)
- Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems (Q5126774) (← links)
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles (Q5222560) (← links)
- Paths in Hypergraphs: A Rescaling Phenomenon (Q5244124) (← links)
