P. Frankl

发表

Extremal problems on set systems

V. Rödl, P. Frankl, 2002 .

EXTREMAL PROBLEMS ON SET SYSTEMSPETER FRANKL AND VOJT

P. Frankl, 2002 .

On subsets of abelian groups with no 3-term arithmetic progression

Vojtech Rödl, Peter Frankl, Ronald L. Graham, 1987, J. Comb. Theory, Ser. A.

BPP and the polynomial time hierarchy in communication complexity

Janos Simon, P. Frankl, L. Babai, 1986 .

Families of finite sets in which no set is covered by the union ofr others

P. Erdös, P. Frankl, Z. Füredi, 1985 .

Some geometric applications of the beta distribution

P. Frankl, H. Maehara, 1990 .

Geometrical realization of set systems and probabilistic communication complexity

Vojtech Rödl, Noga Alon, Peter Frankl, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

The Johnson-Lindenstrauss lemma and the sphericity of some graphs

Peter Frankl, Hiroshi Maehara, P. Frankl, 1987, J. Comb. Theory B.

Algebraic, extremal and metric combinatorics, 1986

P. Frankl, I. Rosenberg, M. Deza, 1988 .

Families of finite sets containing nok disjoint sets and their union

P. Frankl, 1977 .

Intersection and Containment Problems Without Size Restrictions

P. Frankl, I. Rosenberg, M. Deza, 1988 .

On the maximum number of edges in a hypergraph with given matching number

Peter Frankl, P. Frankl, 2012, Discret. Appl. Math..

Extremal set systems

P. Frankl, 1996 .

Complexity classes in communication complexity theory

Peter Frankl, László Babai, Janos Simon, 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

Sets of finite sets satisfying union conditions

D. E. Daykin, P. Frankl, 1982 .

Linear Algebra Methods in Combinatorics I

P. Frankl, L. Babai, 1988 .

On functions of strengtht

P. Frankl, M. Deza, N. Singhi, 1983 .

Intersection Theorems for Finite Sets and Geometric Applications

P. Frankl, PETER FRANKL, 2010 .

Sharp Sets of Permutations

Peter J. Cameron, Peter Frankl, M. Deza, 1987 .

Bounds on the maximum number of vectors with given scalar products

Peter Frankl, M. Deza, P. Frankl, 1985 .

FAMILIES OF FINITE SETS WITH MISSING INTERSECTIONS

Zoltán Füredi, Peter Frankl, P. Frankl, 1984 .

Erdös–Ko–Rado Theorem—22 Years Later

Peter Frankl, M. Deza, P. Frankl, 1983 .

INTERSECTION PROPERTIES OF SYSTEMS OF FINITE SETS

Paul Erdös, Peter Frankl, Michel Deza, 1978 .

Some remarks on graphs without rainbow triangles

A. Rényi, P. Frankl, C. Tompkins, 2022 .

On local Tur\'an problems

P. Frankl, V. Rodl, Hao-wei Huang, 2020, 2004.08734.

All triangles are Ramsey

V. Rödl, P. Frankl, 1986 .

A partition property of simplices in Euclidean space

V. Rödl, P. Frankl, 1990 .

The number of sub-matrics of a given type in a Hadamard matrix and related results

V. Rödl, P. Frankl, Richard M. Wilson, 1987 .

The chromatic number of kneser hypergraphs

Noga Alon, László Lovász, Peter Frankl, 1986 .

Weighted multiply intersecting families

Norihide Tokushige, Peter Frankl, P. Frankl, 2003 .

Union-Free Families of Sets and Equations over Fields

Zoltán Füredi, Peter Frankl, P. Frankl, 1986 .

Extremal set theory for the binomial norm

Peter Frankl, P. Frankl, 2019, J. Comb. Theory, Ser. A.

List of my favorite publications

P. Frankl, L. Babai, N. Nikolov, 2014 .

Complexity classes in communication complexity theory (preliminary version)

Peter Frankl, László Babai, Janos Simon, 1986, IEEE Annual Symposium on Foundations of Computer Science.

Shadows of colored complexes.

Zoltán Füredi, Peter Frankl, P. Frankl, 1988 .

Two problems of P. Erdős on matchings in set families pdf

Peter Frankl, Andrey Kupavskii, P. Frankl, 2016, ArXiv.

The Erd\H{o}s Matching Conjecture and concentration inequalities.

P. Frankl, A. Kupavskii, 2018, 1806.08855.

Random walks and multiply intersecting families

Norihide Tokushige, Peter Frankl, P. Frankl, 2005, J. Comb. Theory, Ser. A.

A note on the universal and canonically colored sequences

V. Rödl, P. Frankl, A. Dudek, 2009 .

Borsuk and Ramsey type questions in Euclidean space

P. Frankl, C. Reiher, V. Rodl, 2017, 1702.03707.

Strong ramsey properties of simplices

V. Rödl, P. Frankl, 2004 .

On the Distribution of Monochromatic Configurations

R. Graham, V. Rödl, P. Frankl, 1989 .

A short proof for a theorem of Harper about Hamming-spheres

Zoltán Füredi, Peter Frankl, P. Frankl, 1981, Discret. Math..

Extremal problems on set systems

Vojtech Rödl, Peter Frankl, V. Rödl, 2002, Random Struct. Algorithms.

DISJOINT r-TUPLES IN AN r-GRAPH WITH GIVEN MAXIMUM DEGREE

Zoltán Füredi, Peter Frankl, P. Frankl, 1983 .

Families in Which Disjoint Sets Have Large Union

N. Alon, P. Frankl, N. Alon, 1989 .

On a Conjecture of Chvátal on m -Intersecting Hypergraphs

Jean-Claude Bermond, Peter Frankl, P. Frankl, 1977 .

On the maximum of the sum of the sizes of non-trivial cross-intersecting families

P. Frankl, 2022, 2209.01826.

Best possible bounds on the number of distinct differences in intersecting families

P. Frankl, A. Kupavskii, S. Kiselev, 2021, European Journal of Combinatorics.

Minimum degree and diversity in intersecting antichains

P. Frankl, 2020 .

Partition‐free families of sets

P. Frankl, A. Kupavskii, 2019, Proceedings of the London Mathematical Society.

Improved Upper Bounds Concerning the Erdős-Ko-Rado Theorem

A. Robert Calderbank, Peter Frankl, A. Calderbank, 1992, Combinatorics, Probability and Computing.

ON SUPERSATURATED SET SYSTEMS 1

V. Rödl, P. Frankl, Y. Kohayakawa, 2014 .

Infinite quasigroups with given regular automorphism groups

P. Frankl, L. Babai, 1978 .

Intersecting families with sunflower shadows

P. Frankl, J. Wang, 2022, Acta Mathematica Hungarica.

Pseudo sunflowers

P. Frankl, 2022, European Journal of Combinatorics.

Minimum degree and diversity in intersecting antichains

P. Frankl, 2020, Acta Mathematica Hungarica.

Constructive Ramsey Bounds and Intersection Theorems for Sets

P. Frankl, 1990 .

Erd\H os-Ko-Rado theorem for $\{0,\pm 1\}$-vectors

P. Frankl, A. Kupavskii, 2015, 1510.03912.

On the Minimum Number of Sets Comparable with Some Members of a Set of Finite Sets

P. Frankl, A. Hilton, 1977 .

Diversity

P. Frankl, A. Kupavskii, 2020, J. Comb. Theory, Ser. A.

Cells in the box and a hyperplane

P. Frankl, I. Bárány, 2020, 2004.12306.

Some Ramsey-Turán type results for hypergraphs

Vojtech Rödl, Peter Frankl, V. Rödl, 1988, Comb..

Intersection theorems with geometric consequences

Peter Frankl, Richard M. Wilson, P. Frankl, 1981, Comb..

Some best possible bounds concerning the traces of finite sets

Peter Frankl, M. Watanabe, P. Frankl, 1994, Graphs Comb..

Density results for uniform families

Peter Frankl, M. Watanabe, P. Frankl, 1994, Comb..

A sharpening of Fisher's inequality

Zoltán Füredi, Peter Frankl, P. Frankl, 1991, Discret. Math..

Traces of antichains

Peter Frankl, P. Frankl, 1989, Graphs Comb..

Union-free Hypergraphs and Probability Theory

Zoltán Füredi, Peter Frankl, P. Frankl, 1984, Eur. J. Comb..

On Sperner Families Satisfying an Additional Condition

Peter Frankl, P. Frankl, 1976, J. Comb. Theory, Ser. A.

Isomorphisms of Cayley graphs. II

Peter Frankl, László Babai, P. Frankl, 1979 .

Four-vertex traces of finite sets

P. Frankl, Jian Wang, 2023, 2301.05830.

A Variant of the VC-dimension with Applications to Depth-3 Circuits

Peter Frankl, Navid Talebanfard, Svyatoslav Gryaznov, 2021, ITCS.

Shattered matchings in intersecting hypergraphs

P. Frankl, J. Pach, 2020, Moscow Journal of Combinatorics and Number Theory.

Some recent results on Ramsey-type numbers

Andrzej Dudek, Vojtech Rödl, Peter Frankl, 2013, Discret. Appl. Math..

Bounding one-way differences

P. Frankl, J. Pach, Z. Füredi, 1987, Graphs Comb..

Extremal problems whose solutions are the blowups of the small witt-designs

Zoltán Füredi, Peter Frankl, P. Frankl, 1989, J. Comb. Theory, Ser. A.

An exact result for 3-graphs

Zoltán Füredi, Peter Frankl, P. Frankl, 1984, Discret. Math..

On the Trace of Finite Sets

Peter Frankl, P. Frankl, 1983, J. Comb. Theory, Ser. A.

Near Perfect Coverings in Graphs and Hypergraphs

Vojtech Rödl, Peter Frankl, V. Rödl, 1985, Eur. J. Comb..

The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem

Peter Frankl, Richard P. Stanley, Anders Björner, 1987, Comb..

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

Vojtech Rödl, Paul Erdös, Peter Frankl, 1986, Graphs Comb..

Orthogonal vectors in then-dimensional cube and codes with missing distances

Peter Frankl, P. Frankl, 1986, Comb..

Hamiltonian Cubic Graphs and Centralizers of Involutions

P. Frankl, L. Babai, J. Kollár, 1979, Canadian Journal of Mathematics.

The maximum number of disjoint pairs in a family of subsets

Noga Alon, Peter Frankl, N. Alon, 1985, Graphs Comb..

A new extremal property of Steiner triple-systems

Zoltán Füredi, Peter Frankl, P. Frankl, 1984, Discret. Math..

Exact solution of some Turán-type problems

Zoltán Füredi, Peter Frankl, P. Frankl, 1987, J. Comb. Theory, Ser. A.

A helly type theorem for hypersurfaces

Peter Frankl, Mikhail Deza, P. Frankl, 1987, J. Comb. Theory, Ser. A.

Every large set of equidistant (0, +1, −1)-vectors forms a sunflower

Peter Frankl, Michel Deza, P. Frankl, 1981, Comb..

Cops and robbers in graphs with large girth and Cayley graphs

Peter Frankl, P. Frankl, 1987, Discret. Appl. Math..

On a pursuit game on cayley graphs

Peter Frankl, P. Frankl, 1987, Comb..

The Radon transform on Abelian Groups

Peter Frankl, Ronald L. Graham, R. Graham, 1987, J. Comb. Theory, Ser. A.

The Erdős Matching Conjecture and concentration inequalities

P. Frankl, A. Kupavskii, PETER FRANKL, 2022, J. Comb. Theory, Ser. B.

On the size of shadow-added intersecting families

Peter Frankl, P. Frankl, 2021, Eur. J. Comb..

On the maximum number of edges in hypergraphs with fixed matching and clique number

P. Frankl, Jian Wang, E. Liu, 2020, Eur. J. Comb..

Old and new applications of Katona's circle

Peter Frankl, P. Frankl, 2020, Eur. J. Comb..

Families of finite sets satisfying intersection restrictions

Peter Frankl, P. Frankl, 2020, Discret. Appl. Math..

Proof of the Erdős matching conjecture in a new range

P. Frankl, 2017 .

Families with no matchings of size s

Peter Frankl, Andrey Kupavskii, P. Frankl, 2017, Electron. Notes Discret. Math..

Invitation to intersection problems for finite sets

Norihide Tokushige, Peter Frankl, P. Frankl, 2016, J. Comb. Theory, Ser. A.

A short proof of Erdős’ conjecture for triple systems

V. Rödl, P. Frankl, A. Rucinski, 2016 .

Two problems on matchings in set families - In the footsteps of Erdős and Kleitman

P. Frankl, A. Kupavskii, 2016, J. Comb. Theory, Ser. B.

On Matchings in Hypergraphs

Peter Frankl, Tomasz Luczak, Katarzyna Mieczkowska, 2012, Electron. J. Comb..

Improved bounds for Erd ˝ os' Matching Conjecture

Peter Frankl, P. Frankl, 2013 .

Colored packing of sets

Zoltán Füredi, Peter Frankl, P. Frankl, 1987 .

On the Maximum Number of Permutations with Given Maximal or Minimal Distance

Peter Frankl, Mikhail Deza, P. Frankl, 1977, J. Comb. Theory, Ser. A.

Turán graphs with bounded matching number

N. Alon, P. Frankl, 2022, arXiv.org.

A Hilton-Milner Theorem for Vector Spaces

Aart Blokhuis, Andries E. Brouwer, Peter Frankl, 2010, Electron. J. Comb..

The Erdös-Ko-Rado theorem for vector spaces

Peter Frankl, Richard M. Wilson, P. Frankl, 1986, J. Comb. Theory, Ser. A.

Some intersection theorems for ordered sets and graphs

Fan Chung Graham, Peter Frankl, Ronald L. Graham, 1986, J. Comb. Theory, Ser. A.

Forbidding Just One Intersection

Zoltán Füredi, Peter Frankl, P. Frankl, 1985, J. Comb. Theory, Ser. A.

On the vector space of 0-configurations

P. Frankl, M. Deza, P. Frankl, 1982, Comb..

Good coverings of Hamming spaces with spheres

Gérard D. Cohen, Peter Frankl, G. Cohen, 1985, Discret. Math..

How (Not) to Cut Your Cheese

Peter Frankl, Imre Bárány, P. Frankl, 2021, Am. Math. Mon..

On intersecting families of finite sets

Peter Frankl, P. Frankl, 1978, Bulletin of the Australian Mathematical Society.

Non-trivial intersecting families

Zoltán Füredi, Peter Frankl, P. Frankl, 1986, J. Comb. Theory, Ser. A.

Maximum degree and diversity in intersecting hypergraphs

Peter Frankl, P. Frankl, 2020, J. Comb. Theory, Ser. B.

An Extremal Problem for two Families of Sets

P. FRANKL, P. Frankl, 1982, Eur. J. Comb..

Finite projective spaces and intersecting hypergraphs

Zoltán Füredi, Peter Frankl, P. Frankl, 1986, Comb..

All rationals occur as exponents

Peter Frankl, P. Frankl, 1986, J. Comb. Theory, Ser. A.

On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices

P Frankl, Z Füredi, P. Frankl, 1984, J. Comb. Theory, Ser. A.

Linear Dependencies among Subsets of a Finite Set

Peter Frankl, Navin M. Singhi, P. Frankl, 1983, Eur. J. Comb..

An extremal set theoretical characterization of some steiner systems

Peter Frankl, P. Frankl, 1983, Comb..

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels

Vojtech Rödl, Noga Alon, Hao Huang, 2011, J. Comb. Theory, Ser. A.

Graphs without rainbow triangles

P. Frankl, 2022, 2203.07768.

The Uniformity Lemma for hypergraphs

Vojtech Rödl, Peter Frankl, V. Rödl, 1992, Graphs Comb..

Extremal results for graphs avoiding a rainbow subgraph

P. Frankl, C. Tompkins, Ervin GyHori, 2022, 2204.07567.

Simple juntas for shifted families pdf

Peter Frankl, Andrey Kupavskii, P. Frankl, 2019, discrete Analysis.

Improved bounds for Erdős' Matching Conjecture

Peter Frankl, P. Frankl, 2013, J. Comb. Theory, Ser. A.

A new generalization of the Erdős-Ko-Rado theorem

Zoltán Füredi, Peter Frankl, P. Frankl, 1983, Comb..

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size

Vojtech Rödl, Peter Frankl, Andrzej Rucinski, 2012, Combinatorics, Probability and Computing.

An Erdos-Ko-Rado Theorem for Direct Products

Peter Frankl, P. Frankl, 1996, Eur. J. Comb..

On the chromatic number of the general Kneser-graph

Peter Frankl, P. Frankl, 1985, J. Graph Theory.

Research Problems Graphs and Combinatorics

P. Frankl, P. Frankl, J. Akiyama, 1985 .

What must be contained in every oriented k-uniform hypergraph

Peter Frankl, P. Frankl, 1986, Discret. Math..

A new short proof for the Kruskal-Katona theorem

Peter Frankl, P. Frankl, 1984, Discret. Math..

Families of Finite Sets in Which No Set Is Covered by the Union of Two Others

Zoltán Füredi, Paul Erdös, Peter Frankl, 1982, J. Comb. Theory, Ser. A.

On squashed design

Peter Frankl, Michel Deza, P. Frankl, 1986, Discret. Comput. Geom..

Embedding the n-cube in Lower Dimensions

Peter Frankl, Hiroshi Maehara, P. Frankl, 1986, Eur. J. Comb..

Quantitative theorems for regular systems of equations

Vojtech Rödl, Peter Frankl, Ronald L. Graham, 1988, J. Comb. Theory, Ser. A.

Uniform s-Cross-Intersecting Families

Peter Frankl, Andrey Kupavskii, P. Frankl, 2016, Combinatorics, Probability and Computing.

Erdös-Ko-Rado theorem with conditions on the maximal degree

Peter Frankl, P. Frankl, 1987, J. Comb. Theory, Ser. A.

Extremal problems concerning Kneser graphs

Zoltán Füredi, Peter Frankl, P. Frankl, 1986, J. Comb. Theory, Ser. B.

Some Best Possible Inequalities Concerning Cross-Intersecting Families

Norihide Tokushige, Peter Frankl, P. Frankl, 1992, J. Comb. Theory, Ser. A.

Partition‐free families of sets

P. Frankl, A. Kupavskii, 2017, Proceedings of the London Mathematical Society.

Families of sets with no matchings of sizes 3 and 4

Peter Frankl, Andrey Kupavskii, P. Frankl, 2017, Eur. J. Comb..

Inequalities for Subsets of a Set and KLYM Posets

Peter Frankl, David E. Daykin, D. E. Daykin, 1983 .

The convex hull of antichains in posets

Peter Frankl, P. Frankl, 1992, Comb..

Improved bounds for Erdős' Matching Conjecture

P. Frankl, 2013, J. Comb. Theory, Ser. A.

Intersection theorems and mod p rank of inclusion matrices

Peter Frankl, P. Frankl, 1990, J. Comb. Theory, Ser. A.

Extremal Problems for Finite Sets

P. Frankl, N. Tokushige, 2018, The Student Mathematical Library.

Probabilities for intersecting systems and random subsets of finite sets

Jeffrey C. Lagarias, Peter C. Fishburn, Peter Frankl, 1986 .

The Erdös-Ko-Rado theorem for vector spaces

P. Frankl, R. Wilson, 1986, J. Comb. Theory A.

A new generalization of the Erdős-Ko-Rado theorem

P. Frankl, Z. Füredi, 1983, Comb..

Counting Intersecting and Pairs of Cross-Intersecting Families pdf

Peter Frankl, Andrey Kupavskii, P. Frankl, 2017, Combinatorics, Probability and Computing.