The following pages link to Peter Frankl (Q168624):
Displaying 50 items.
- Forbidding just one intersection (Q1062676) (← links)
- Lower bounds for Turán's problem (Q1065822) (← links)
- Intersection theorems for vector spaces (Q1065892) (← links)
- The maximum number of disjoint pairs in a family of subsets (Q1066898) (← links)
- Extremal hypergraph problems and convex hulls (Q1066910) (← links)
- Good coverings of Hamming spaces with spheres (Q1068057) (← links)
- Non-trivial intersecting families (Q1069937) (← links)
- Families of finite sets in which no set is covered by the union of \(r\) others (Q1072559) (← links)
- Polytopes determined by hypergraph classes (Q1073043) (← links)
- Union-free families of sets and equations over fields (Q1073796) (← links)
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent (Q1076037) (← links)
- Large triangle-free subgraphs in graphs without \(K_ 4\) (Q1078195) (← links)
- All rationals occur as exponents (Q1082340) (← links)
- The Radon transform on abelian groups (Q1085380) (← links)
- Induced restricted Ramsey theorems for spaces (Q1086252) (← links)
- Open-interval graphs versus closed-interval graphs (Q1086256) (← links)
- The Erdős-Ko-Rado theorem for vector spaces (Q1086589) (← links)
- On subsets of abelian groups with no 3-term arithmetic progression (Q1088718) (← links)
- On a pursuit game on Cayley graphs (Q1090336) (← links)
- Cops and robbers in graphs with large girth and Cayley graphs (Q1092060) (← links)
- Near perfect coverings in graphs and hypergraphs (Q1092067) (← links)
- What must be contained in every oriented k-uniform hypergraph (Q1092925) (← links)
- The maximum number of edges in a 3-graph not containing a given star (Q1095933) (← links)
- An Erdős-Ko-Rado theorem for integer sequences of given rank (Q1096631) (← links)
- On squashed designs (Q1097892) (← links)
- Finite projective spaces and intersecting hypergraphs (Q1101456) (← links)
- Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances (Q1104935) (← links)
- Sharp sets of permutations (Q1105023) (← links)
- The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem (Q1106221) (← links)
- Quantitative theorems for regular systems of equations (Q1108271) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- The number of submatrices of a given type in a Hadamard matrix and related results (Q1111555) (← links)
- Some Ramsey-Turán type results for hypergraphs (Q1111567) (← links)
- Erdős-Ko-Rado theorem with conditions on the maximal degree (Q1112818) (← links)
- Exact solution of some Turán-type problems (Q1112819) (← links)
- Intersection theorems in permutation groups (Q1113278) (← links)
- Bounding one-way differences (Q1114687) (← links)
- Hypergraphs do not jump (Q1114711) (← links)
- Solution of the Littlewood-Offord problem in high dimensions (Q1117235) (← links)
- A lower bound on the size of a complex generated by an antichain (Q1119639) (← links)
- The Johnson-Lindenstrauss lemma and the sphericity of some graphs (Q1121912) (← links)
- Helly-type theorems for varieties (Q1124641) (← links)
- On the maximum number of edges in a hypergraph whose linegraph contains no cycle (Q1143416) (← links)
- On tilings of the binary vector space (Q1148323) (← links)
- On the number of maximal dependencies in a data base relation of fixed order (Q1148702) (← links)
- A finite set intersection theorem (Q1152365) (← links)
- Extremal problems and coverings of the space (Q1153096) (← links)
- On a problem of Chvatal and Erdoes on hypergraphs containing no generalized simplex (Q1159695) (← links)
- On large vector systems with equal scalar products (Q1161575) (← links)
- Local Turan property for k-graphs (Q1161763) (← links)
