default search action
László Pyber
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [p1]László Pyber:
How Abelian is a Finite Group? The Mathematics of Paul Erdős I 2013: 409-423
2000 – 2009
- 2008
- [c3]László Babai, Nikolay Nikolov, László Pyber:
Product growth and mixing in finite groups. SODA 2008: 248-257 - 2003
- [j25]Miklós Abért, Alexander Lubotzky
, László Pyber:
Bounded Generation and Linear Groups. Int. J. Algebra Comput. 13(4): 401-413 (2003) - 2000
- [j24]Antal Balog, László Pyber, Avinoam Mann:
Polynomial Index Growth Groups. Int. J. Algebra Comput. 10(6): 773-782 (2000)
1990 – 1999
- 1999
- [j23]László Pyber:
A Bound for the Diameter of Distance-Regular Graphs. Comb. 19(4): 549-553 (1999) - 1997
- [j22]Paul Erdös, László Pyber:
Covering a graph by complete bipartite graphs. Discret. Math. 170(1-3): 249-251 (1997) - 1996
- [j21]László Pyber:
Dense Graphs and Edge Reconstruction. Comb. 16(4): 521-525 (1996) - [j20]László Pyber, Aner Shalev:
Groups with Super-Exponential Subgroup Growth. Comb. 16(4): 527-533 (1996) - [j19]László Pyber:
Covering the Edges of a Connected Graph by Paths. J. Comb. Theory B 66(1): 152-159 (1996) - 1995
- [j18]László Pyber, Vojtech Rödl, Endre Szemerédi:
Dense Graphs without 3-Regular Subgraphs. J. Comb. Theory B 63(1): 41-54 (1995) - [c2]László Pyber:
Asymptotic results for simple groups and some applications. Groups and Computation 1995: 309-327 - 1994
- [j17]László Babai, László Pyber:
Permutation Groups without Exponentially Many Orbits on the Power Set. J. Comb. Theory A 66(1): 160-168 (1994) - 1993
- [j16]Tomasz Luczak
On Random Generation of the Symmetic Group. Comb. Probab. Comput. 2: 505-512 (1993) - [j15]László Pyber, Zsolt Tuza:
Menger-type theorems with restrictions on path lengths. Discret. Math. 120(1-3): 161-174 (1993) - [j14]László Pyber:
On the Orders of Doubly Transitive Permutation Groups, Elementary Estimates. J. Comb. Theory A 62(2): 361-366 (1993) - 1991
- [j13]Paul Erdös, András Gyárfás, László Pyber:
Vertex coverings by monochromatic cycles and trees. J. Comb. Theory B 51(1): 90-95 (1991) - [c1]László Pyber:
Asymptotic Results for Permutation Groups. Groups And Computation 1991: 197-219 - 1990
- [j12]Leif K. Jørgensen, László Pyber:
Covering a graph by topological complete subgraphs. Graphs Comb. 6(2): 161-171 (1990) - [j11]László Pyber:
The edge reconstruction of hamiltonian graphs. J. Graph Theory 14(2): 173-179 (1990)
1980 – 1989
- 1988
- [j10]Alexandr V. Kostochka, László Pyber:
Samll topological complete subgraphs of "dense" graphs. Comb. 8(1): 83-86 (1988) - [j9]László Pyber:
Finding defective coins. Graphs Comb. 4(1): 393-394 (1988) - [j8]Mark N. Ellingham, László Pyber, Xingxing Yu:
Claw-free graphs are edge reconstructible. J. Graph Theory 12(3): 445-451 (1988) - 1987
- [j7]László Pyber:
On one-factorizations of the complete graph. Discret. Math. 67(2): 209-210 (1987) - 1986
- [j6]László Pyber:
Clique covering of graphs. Comb. 6(4): 393-398 (1986) - [j5]László Pyber:
How to find many counterfeit coins? Graphs Comb. 2(1): 173-177 (1986) - [j4]László Pyber:
A new generalization of the Erdös-Ko-Rado theorem. J. Comb. Theory A 43(1): 85-90 (1986) - 1985
- [j3]László Pyber:
An Erdös - Gallai conjecture. Comb. 5(1): 67-79 (1985) - [j2]László Pyber:
Regular subgraphs of dense graphs. Comb. 5(4): 347-349 (1985) - 1984
- [j1]László Pyber:
An extension of a frankl-füredi theorem. Discret. Math. 52(2-3): 253-268 (1984)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: