According to our database1, László Pyber authored at least 29 papers between 1984 and 2013.
Legend:Book In proceedings Article PhD thesis Other
How Abelian is a Finite Group?
Proceedings of the Mathematics of Paul Erdős I, 2013
Product growth and mixing in finite groups.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
Bounded Generation and Linear Groups.
Polynomial Index Growth Groups.
A Bound for the Diameter of Distance-Regular Graphs.
Covering a graph by complete bipartite graphs.
Discrete Mathematics, 1997
Covering the Edges of a Connected Graph by Paths.
J. Comb. Theory, Ser. B, 1996
Groups with Super-Exponential Subgroup Growth.
Dense Graphs and Edge Reconstruction.
Dense Graphs without 3-Regular Subgraphs.
J. Comb. Theory, Ser. B, 1995
Asymptotic results for simple groups and some applications.
Proceedings of the Groups and Computation, 1995
Permutation Groups without Exponentially Many Orbits on the Power Set.
J. Comb. Theory, Ser. A, 1994
On the Orders of Doubly Transitive Permutation Groups, Elementary Estimates.
J. Comb. Theory, Ser. A, 1993
Menger-type theorems with restrictions on path lengths.
Discrete Mathematics, 1993
On Random Generation of the Symmetic Group.
Combinatorics, Probability & Computing, 1993
Vertex coverings by monochromatic cycles and trees.
J. Comb. Theory, Ser. B, 1991
Asymptotic Results for Permutation Groups.
Proceedings of the Groups And Computation, 1991
The edge reconstruction of hamiltonian graphs.
Journal of Graph Theory, 1990
Covering a graph by topological complete subgraphs.
Graphs and Combinatorics, 1990
Claw-free graphs are edge reconstructible.
Journal of Graph Theory, 1988
Finding defective coins.
Graphs and Combinatorics, 1988
Samll topological complete subgraphs of "dense" graphs.
On one-factorizations of the complete graph.
Discrete Mathematics, 1987
A new generalization of the Erdös-Ko-Rado theorem.
J. Comb. Theory, Ser. A, 1986
How to find many counterfeit coins?
Graphs and Combinatorics, 1986
Clique covering of graphs.
Regular subgraphs of dense graphs.
An Erdös - Gallai conjecture.
An extension of a frankl-füredi theorem.
Discrete Mathematics, 1984