Peter Frankl
Peter Frankl
Подтвержден адрес электронной почты в домене renyi.mta.hu
Название
Процитировано
Процитировано
Год
Intersection theorems with geometric consequences
P Frankl, RM Wilson
Combinatorica 1 (4), 357-368, 1981
5581981
Families of finite sets in which no set is covered by the union of r others
P Erdős, P Frankl, Z Füredi
Israel Journal of Mathematics 51 (1-2), 79-89, 1985
531*1985
Complexity classes in communication complexity theory
L Babai, P Frankl, J Simon
27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 337-347, 1986
3891986
The Johnson-Lindenstrauss lemma and the sphericity of some graphs
P Frankl, H Maehara
Journal of Combinatorial Theory, Series B 44 (3), 355-362, 1988
3211988
Linear Algebra Methods in Combinatorics: With Applications to Geometry and Computer Science
L Babai, P Frankl
Department of Computer Science, univ. of Chicag, 1992
3091992
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent
P Erdös, P Frankl, V Rödl
Graphs and Combinatorics 2 (1), 113-121, 1986
2711986
Some intersection theorems for ordered sets and graphs
FRK Chung, RL Graham, P Frankl, JB Shearer
Journal of Combinatorial Theory, Series A 43 (1), 23-37, 1986
2531986
On the maximum number of permutations with given maximal or minimal distance
P Frankl, M Deza
Journal of Combinatorial Theory, Series A 22 (3), 352-360, 1977
2331977
Forbidden intersections
P Frankl, V Rödl
Transactions of the American Mathematical Society 300 (1), 259-286, 1987
2301987
The shifting technique in extremal set theory
P Frankl
Surveys in combinatorics 123, 81-110, 1987
2111987
An extremal problem for two families of sets
P Frankl
European Journal of Combinatorics 3 (2), 125-127, 1982
1961982
The Erdos-Ko-Rado theorem is true for n= ckt
P Frankl
Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976) 1, 365-375, 1978
1891978
Extremal problems on set systems
P Frankl, V Rödl
Random Structures & Algorithms 20 (2), 131-164, 2002
1882002
Erdös–Ko–Rado theorem—22 years later
M Deza, P Frankl
SIAM Journal on Algebraic Discrete Methods 4 (4), 419-431, 1983
1801983
Near perfect coverings in graphs and hypergraphs
P Frankl, V Rödl
European Journal of Combinatorics 6 (4), 317-326, 1985
1641985
Cops and robbers in graphs with large girth and Cayley graphs
P Frankl
Discrete Applied Mathematics 17 (3), 301-305, 1987
1581987
The Erdös-Ko-Rado theorem for vector spaces
P Frankl, RM Wilson
Journal of Combinatorial Theory, Series A 43 (2), 228-236, 1986
1541986
Hypergraphs do not jump
P Frankl, V Rödl
Combinatorica 4 (2-3), 149-159, 1984
1331984
The chromatic number of Kneser hypergraphs
N Alon, P Frankl, L Lovász
Transactions of the American Mathematical Society 298 (1), 359-370, 1986
1301986
Large triangle-free subgraphs in graphs withoutK 4
P Frankl, V Rödl
Graphs and Combinatorics 2 (1), 135-144, 1986
1101986
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20