The following pages link to Forbidden Intersections (Q3751579):
Displaying 50 items.
- Quantum homomorphisms (Q257001) (← links)
- Conic formulations of graph homomorphisms (Q295829) (← links)
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
- Deterministic quantum non-locality and graph colorings (Q387022) (← links)
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections (Q483655) (← links)
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207) (← links)
- Set families with a forbidden pattern (Q518191) (← links)
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- Invitation to intersection problems for finite sets (Q739389) (← links)
- On a restricted cross-intersection problem (Q855846) (← links)
- Problems from CGCS Luminy, May 2007 (Q966173) (← links)
- Uniformly cross intersecting families (Q987560) (← links)
- Lower bounds for measurable chromatic numbers (Q1047119) (← links)
- Codes with given distances (Q1094390) (← links)
- A generalization of the Katona theorem for cross t-intersecting families (Q1119578) (← links)
- On cross-intersecting families (Q1201261) (← links)
- Sets of vectors with many orthogonal pairs (Q1205349) (← links)
- Intersection statements for systems of sets (Q1369684) (← links)
- On the size of set systems on \([n]\) not containing weak \((r,\Delta)\)-systems (Q1369741) (← links)
- A tale of stars and cliques (Q1671776) (← links)
- Sabidussi versus Hedetniemi for three variations of the chromatic number (Q1677539) (← links)
- On a Frankl-Rödl theorem and its geometric corollaries (Q1690051) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Strong Ramsey properties of simplices (Q1885594) (← links)
- Finite Euclidean Ramsey theory (Q1906140) (← links)
- Edge-Ramsey theory (Q1913602) (← links)
- Unavoidable hypergraphs (Q1984522) (← links)
- Fractional \(L\)-intersecting families (Q2001971) (← links)
- Disjoint pairs in set systems with restricted intersection (Q2011127) (← links)
- Simplices and regular polygonal tori in Euclidean Ramsey theory (Q2088716) (← links)
- Bisecting and \(D\)-secting families for set systems (Q2181239) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- System of unbiased representatives for a collection of bicolorings (Q2201776) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- \(d\)-Galvin families (Q2294104) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- Forbidding intersection patterns between layers of the cube (Q2347972) (← links)
- New lower bounds for the chromatic number of a space with forbidden isosceles triangles (Q2356524) (← links)
- On the chromatic number of a space with a forbidden regular simplex (Q2358587) (← links)
- On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- Improvements of the Frankl-Rödl theorem and geometric consequences (Q2411792) (← links)
- On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (Q2452861) (← links)
- A note on the stability number of an orthogonality graph (Q2643845) (← links)
- Binary scalar products (Q2673478) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Hypercontractive inequalities via SOS, and the Frankl-Rödl graph (Q2826231) (← links)
