P. Frankl - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2010

A Hilton-Milner Theorem for Vector SpacesAart Blokhuis, Andries E. Brouwer, A. Chowdhury, P. Frankl, T. Mussche, B. Patkós, Tamás Szönyi. combinatorics, 17(1), 2010. [doi]

1997

Hardware Test: Can We Learn from Software Testing?J. Abraham, P. Frankl, Christian Landrault, Meryem Marzouki, Paolo Prinetto, Chantal Robach, Pascale Thévenod-Fosse. vts 1997: 320-321 [doi]

1991

Multiply-intersecting familiesP. Frankl. JCT, 53(2):195-234, 1991. [doi]

Shadows and shiftingP. Frankl. gc, 7(1):23-29, 1991. [doi]

1990

An intersection problem for codesP. Frankl. DM, 84(2):135-141, 1990. [doi]

Asymptotic solution of a turán-type problemP. Frankl. gc, 6(3):223-227, 1990. [doi]

1989

A lower bound on the size of a complex generated by an antichainP. Frankl. DM, 76(1):51-56, 1989. [doi]

Traces of antichainsP. Frankl. gc, 5(1):295-299, 1989. [doi]

1987

Codes with given distancesH. Enomoto, P. Frankl, N. Ito, K. Nomura. gc, 3(1):25-38, 1987. [doi]

1986

What must be contained in every oriented k-uniform hypergraphP. Frankl. DM, 62(3):311-313, 1986. [doi]

1985

On the chromatic number of the general Kneser-graphP. Frankl. jgt, 9(2):217-220, 1985. [doi]

1984

A new short proof for the Kruskal-Katona theoremP. Frankl. DM, 48(2-3):327-329, 1984. [doi]

1980

On tilings of the binary vector spaceG. Cohen, P. Frankl. DM, 31(3):271-277, 1980. [doi]

1977

On the Minimum Number of Disjoint Pairs in a Family of Finite SetsP. Frankl. JCT, 22(2):249-251, 1977.

Sign in or sign up to see more results.

runs on WebDSL