L. Pyber
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 5%
- Graph theory and applications
- Advanced Topology and Set Theory
Papers in
-
- Limits and Structures in Graph Theory 17
- Finite Group Theory Research 13
-
- Advanced Graph Theory Research 16
- Graph Labeling and Dimension Problems 5
- Co-authors
- Péter L. Erdős (1 shared paper)András Gyárfás (1 shared paper)Paul L. Erdos (1 shared paper)Martin W. Liebeck (1 shared paper)Aner Shalev (2 shared papers)Endre Szemerédi (1 shared paper)Vojtch Rödl (1 shared paper)Alexandr V. Kostochka (1 shared paper)
- Journals
- COMBINATORICA (7 papers)Discrete Mathematics (3 papers)Journal of Combinatorial Theory Series B (3 papers)Journal of Combinatorial Theory Series A (2 papers)Journal of Graph Theory (2 papers)
- Partner nations
- HungaryUnited StatesIsrael
In The Last Decade
L. Pyber
32 papers receiving 528 citations
Peers
Comparison fields: 5 of 32
- Discrete Mathematics and Combinatorics 464
- Geometry and Topology 186
- Computational Theory and Mathematics 336
- Algebra and Number Theory 30
- Artificial Intelligence 136
Countries citing papers authored by L. Pyber
This map shows the geographic impact of L. Pyber's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by L. Pyber with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites L. Pyber more than expected).
Fields of papers citing papers by L. Pyber
This network shows the impact of papers produced by L. Pyber. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by L. Pyber. The network helps show where L. Pyber may publish in the future.
Co-authors
The 17 scholars most cited alongside L. Pyber, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 32 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1991 | 82 | |
| 2 | 1986 | 68 | |
| 3 | 1987 | 37 | |
| 4 | 1995 | 34 | |
| 5 | 1992 | 33 | |
| 6 | 1996 | 31 | |
| 7 | 1997 | 30 | |
| 8 | 1993 | 29 | |
| 9 | 2001 | 26 | |
| 10 | 1985 | 23 | |
| 11 | 1988 | 20 | |
| 12 | 1986 | 17 | |
| 13 | 1985 | 15 | |
| 14 | 1997 | 13 | |
| 15 | 2000 | 10 | |
| 16 | 1986 | 10 | |
| 17 | 1988 | 10 | |
| 18 | 1996 | 10 | |
| 19 | 1990 | 10 | |
| 20 | Isomorphic subgraphs in a graph | 1988 | 9 |
About L. Pyber
L. Pyber is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Electrical and Electronic Engineering and Computer Vision and Pattern Recognition, having authored 32 papers that have together received 580 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (17 papers), Advanced Graph Theory Research (16 papers), Finite Group Theory Research (13 papers), graph theory and CDMA systems (9 papers), Advanced Topology and Set Theory (5 papers), Graph Labeling and Dimension Problems (5 papers), Coding theory and cryptography (4 papers) and Digital Image Processing Techniques (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (464 citations), Geometry and Topology (186 citations), Computational Theory and Mathematics (336 citations), Algebra and Number Theory (30 citations) and Artificial Intelligence (136 citations). L. Pyber has collaborated with scholars based in Hungary, United States and Israel. Frequent co-authors include Péter L. Erdős, András Gyárfás, Paul L. Erdos, Martin W. Liebeck, Aner Shalev, Endre Szemerédi, Vojtch Rödl, Alexandr V. Kostochka, Péter P. Pálfy and Xingxing Yu. Their work appears in journals such as COMBINATORICA, Discrete Mathematics, Journal of Combinatorial Theory Series B, Journal of Combinatorial Theory Series A and Journal of Graph Theory.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.