László Pyber

30 papers A* 1Journal 26Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
On the automorphism group of a distance-regular graph.
J. Comb. Theory B
László Pyber, Saveliy V. Skresanov
2013 — ch.
How Abelian is a Finite Group?
The Mathematics of Paul Erdős I
László Pyber
2008 A* conf
Product growth and mixing in finite groups.
SODA
László Babai, Nikolay Nikolov, László Pyber
2003 J jnl
Bounded Generation and Linear Groups.
Int. J. Algebra Comput.
Miklós Abért, Alexander Lubotzky, László Pyber
2000 J jnl
Polynomial Index Growth Groups.
Int. J. Algebra Comput.
Antal Balog, László Pyber, Avinoam Mann
1999 J jnl
A Bound for the Diameter of Distance-Regular Graphs.
Comb.
László Pyber
1997 J jnl
Covering a graph by complete bipartite graphs.
Discret. Math.
Paul Erdös, László Pyber
1996 J jnl
Covering the Edges of a Connected Graph by Paths.
J. Comb. Theory B
László Pyber
1996 J jnl
Dense Graphs and Edge Reconstruction.
Comb.
László Pyber
1996 J jnl
Groups with Super-Exponential Subgroup Growth.
Comb.
László Pyber, Aner Shalev
1995 — conf
Asymptotic results for simple groups and some applications.
Groups and Computation
László Pyber
1995 J jnl
Dense Graphs without 3-Regular Subgraphs.
J. Comb. Theory B
László Pyber, Vojtech Rödl, Endre Szemerédi
1994 J jnl
Permutation Groups without Exponentially Many Orbits on the Power Set.
J. Comb. Theory A
László Babai, László Pyber
1993 J jnl
Menger-type theorems with restrictions on path lengths.
Discret. Math.
László Pyber, Zsolt Tuza
1993 J jnl
On Random Generation of the Symmetic Group.
Comb. Probab. Comput.
Tomasz Luczak, László Pyber
1993 J jnl
On the Orders of Doubly Transitive Permutation Groups, Elementary Estimates.
J. Comb. Theory A
László Pyber
1991 — conf
Asymptotic Results for Permutation Groups.
Groups And Computation
László Pyber
1991 J jnl
Vertex coverings by monochromatic cycles and trees.
J. Comb. Theory B
Paul Erdös, András Gyárfás, László Pyber
1990 J jnl
Covering a graph by topological complete subgraphs.
Graphs Comb.
Leif K. Jørgensen, László Pyber
1990 J jnl
The edge reconstruction of hamiltonian graphs.
J. Graph Theory
László Pyber
1988 J jnl
Claw-free graphs are edge reconstructible.
J. Graph Theory
Mark N. Ellingham, László Pyber, Xingxing Yu
1988 J jnl
Finding defective coins.
Graphs Comb.
László Pyber
1988 J jnl
Samll topological complete subgraphs of "dense" graphs.
Comb.
Alexandr V. Kostochka, László Pyber
1987 J jnl
On one-factorizations of the complete graph.
Discret. Math.
László Pyber
1986 J jnl
A new generalization of the Erdös-Ko-Rado theorem.
J. Comb. Theory A
László Pyber
1986 J jnl
Clique covering of graphs.
Comb.
László Pyber
1986 J jnl
How to find many counterfeit coins?
Graphs Comb.
László Pyber
1985 J jnl
An Erdös - Gallai conjecture.
Comb.
László Pyber
1985 J jnl
Regular subgraphs of dense graphs.
Comb.
László Pyber
1984 J jnl
An extension of a frankl-füredi theorem.
Discret. Math.
László Pyber