László Pyber - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2013

How Abelian is a Finite Group?László Pyber. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős I. pages 409-423, Springer, 2013. [doi]

2008

Product growth and mixing in finite groupsLászló Babai, Nikolay Nikolov, László Pyber. soda 2008: 248-257 [doi]

2003

Bounded Generation and Linear GroupsMiklós Abért, Alexander Lubotzky, László Pyber. ijac, 13(4):401-413, 2003. [doi]

2000

Polynomial Index Growth GroupsAntal Balog, László Pyber, Avinoam Mann. ijac, 10(6):773-782, 2000. [doi]

1999

A Bound for the Diameter of Distance-Regular GraphsLászló Pyber. combinatorica, 19(4):549-553, 1999. [doi]

1997

Covering a graph by complete bipartite graphsPaul Erdös, László Pyber. DM, 170(1-3):249-251, 1997. [doi]

1996

Covering the Edges of a Connected Graph by PathsLászló Pyber. JCT, 66(1):152-159, 1996. [doi]

Groups with Super-Exponential Subgroup GrowthLászló Pyber, Aner Shalev. combinatorica, 16(4):527-533, 1996.

Dense Graphs and Edge ReconstructionLászló Pyber. combinatorica, 16(4):521-525, 1996.

1995

Asymptotic results for simple groups and some applicationsLászló Pyber. dimacs 1996: 309-328

Dense Graphs without 3-Regular SubgraphsLászló Pyber, Vojtech Rödl, Endre Szemerédi. JCT, 63(1):41-54, 1995. [doi]

1994

Permutation Groups without Exponentially Many Orbits on the Power SetLászló Babai, László Pyber. JCT, 66(1):160-168, 1994.

1993

On Random Generation of the Symmetic GroupTomasz Luczak, László Pyber. cpc, 2:505-512, 1993.

On the Orders of Doubly Transitive Permutation Groups, Elementary EstimatesLászló Pyber. JCT, 62(2):361-366, 1993.

Menger-type theorems with restrictions on path lengthsLászló Pyber, Zsolt Tuza. DM, 120(1-3):161-174, 1993. [doi]

1991

Vertex coverings by monochromatic cycles and treesPaul Erdös, András Gyárfás, László Pyber. JCT, 51(1):90-95, 1991. [doi]

Asymptotic Results for Permutation GroupsLászló Pyber. dimacs 1993: 197-220

1990

Covering a graph by topological complete subgraphsLeif K. Jørgensen, László Pyber. gc, 6(2):161-171, 1990. [doi]

The edge reconstruction of hamiltonian graphsLászló Pyber. jgt, 14(2):173-179, 1990. [doi]

1988

Claw-free graphs are edge reconstructibleMark N. Ellingham, László Pyber, Xingxing Yu. jgt, 12(3):445-451, 1988. [doi]

Samll topological complete subgraphs of dense graphsAlexandr V. Kostochka, László Pyber. combinatorica, 8(1):83-86, 1988.

Finding defective coinsLászló Pyber. gc, 4(1):393-394, 1988. [doi]

1987

On one-factorizations of the complete graphLászló Pyber. DM, 67(2):209-210, 1987. [doi]

1986

A new generalization of the Erdös-Ko-Rado theoremLászló Pyber. JCT, 43(1):85-90, 1986. [doi]

Clique covering of graphsLászló Pyber. combinatorica, 6(4):393-398, 1986.

How to find many counterfeit coins?László Pyber. gc, 2(1):173-177, 1986. [doi]

1985

An Erdös - Gallai conjectureLászló Pyber. combinatorica, 5(1):67-79, 1985.

Regular subgraphs of dense graphsLászló Pyber. combinatorica, 5(4):347-349, 1985.

1984

An extension of a frankl-füredi theoremLászló Pyber. DM, 52(2-3):253-268, 1984. [doi]

Sign in or sign up to see more results.

runs on WebDSL