László Pyber

According to our database, László Pyber authored at least 29 papers between 1984 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of one.

2013

How Abelian is a Finite Group?

László Pyber

Proceedings of the Mathematics of Paul Erdős I, 2013

2008

Product growth and mixing in finite groups.

László Babai, Nikolay Nikolov, László Pyber

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

2003

Bounded Generation and Linear Groups.

Miklós Abért, Alexander Lubotzky, László Pyber

Int. J. Algebra Comput., 2003

2000

Polynomial Index Growth Groups.

Antal Balog, László Pyber, Avinoam Mann

Int. J. Algebra Comput., 2000

1999

A Bound for the Diameter of Distance-Regular Graphs.

László Pyber

Comb., 1999

1997

Covering a graph by complete bipartite graphs.

Paul Erdös, László Pyber

Discret. Math., 1997

1996

Covering the Edges of a Connected Graph by Paths.

László Pyber

J. Comb. Theory, Ser. B, 1996

Groups with Super-Exponential Subgroup Growth.

László Pyber, Aner Shalev

Comb., 1996

Dense Graphs and Edge Reconstruction.

László Pyber

Comb., 1996

1995

Dense Graphs without 3-Regular Subgraphs.

László Pyber, Vojtech Rödl, Endre Szemerédi

J. Comb. Theory, Ser. B, 1995

Asymptotic results for simple groups and some applications.

László Pyber

Proceedings of the Groups and Computation, 1995

1994

Permutation Groups without Exponentially Many Orbits on the Power Set.

László Babai, László Pyber

J. Comb. Theory, Ser. A, 1994

1993

On the Orders of Doubly Transitive Permutation Groups, Elementary Estimates.

László Pyber

J. Comb. Theory, Ser. A, 1993

Menger-type theorems with restrictions on path lengths.

László Pyber, Zsolt Tuza

Discret. Math., 1993

On Random Generation of the Symmetic Group.

Tomasz Luczak, László Pyber

Comb. Probab. Comput., 1993

1991

Vertex coverings by monochromatic cycles and trees.

Paul Erdös, András Gyárfás, László Pyber

J. Comb. Theory, Ser. B, 1991

Asymptotic Results for Permutation Groups.

László Pyber

Proceedings of the Groups And Computation, 1991

1990

The edge reconstruction of hamiltonian graphs.

László Pyber

J. Graph Theory, 1990

Covering a graph by topological complete subgraphs.

Leif K. Jørgensen, László Pyber

Graphs Comb., 1990

1988

Claw-free graphs are edge reconstructible.

Mark N. Ellingham, László Pyber, Xingxing Yu

J. Graph Theory, 1988

Finding defective coins.

László Pyber

Graphs Comb., 1988

Samll topological complete subgraphs of "dense" graphs.

Alexandr V. Kostochka, László Pyber

Comb., 1988

1987

On one-factorizations of the complete graph.

László Pyber

Discret. Math., 1987

1986

A new generalization of the Erdös-Ko-Rado theorem.

László Pyber

J. Comb. Theory, Ser. A, 1986

How to find many counterfeit coins?

László Pyber

Graphs Comb., 1986

Clique covering of graphs.

László Pyber

Comb., 1986

1985

Regular subgraphs of dense graphs.

László Pyber

Comb., 1985

An Erdös - Gallai conjecture.

László Pyber

Comb., 1985

1984

An extension of a frankl-füredi theorem.

László Pyber

Discret. Math., 1984