L. Pyber
-
- Limits and Structures in Graph Theory 14
- Finite Group Theory Research 10
- Geometry and Topology top 5%
- Advanced Topology and Set Theory 5
- Graph theory and applications 3
-
- Advanced Graph Theory Research 16
- Graph Labeling and Dimension Problems 5
-
- graph theory and CDMA systems 7
-
- Digital Image Processing Techniques 3
- Co-authors
- Péter L. ErdősAndrás GyárfásMartin W. LiebeckPaul ErdősEndre SzemerédiV. RödlAlexandr KostochkaAner Shalev
- Cited by
- Discrete Mathematics and CombinatoricsGeometry and TopologyComputational Theory and Mathematics
- Journals
- COMBINATORICA (7 papers)Journal of Combinatorial Theory Series B (3 papers)Discrete Mathematics (3 papers)
- Partner nations
- HungaryUnited StatesIsrael
In The Last Decade
L. Pyber
27 papers receiving 404 citations
Peers
Comparison fields: 5 of 28
- Discrete Mathematics and Combinatorics 366
- Geometry and Topology 145
- Computational Theory and Mathematics 267
- Algebra and Number Theory 27
- Computer Graphics and Computer-Aided Design 12
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-authorship network
The 13 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
| # | Work | ||
|---|---|---|---|
| 1 | 2001 | 23 | |
| 2 | 2000 | 7 | |
| 3 | 1998 | 6 | |
| 4 | 1997 | 10 | |
| 5 | 1997 | 21 | |
| 6 | 1996 | 22 | |
| 7 | 1996 | 1 | |
| 8 | 1995 | 30 | |
| 9 | 1993 | 22 | |
| 10 | 1992 | 28 | |
| 11 | 1991 | 66 | |
| 12 | 1990 | 7 | |
| 13 | 1988 | 9 | |
| 14 | Isomorphic subgraphs in a graph | 1988 | 5 |
| 15 | 1987 | 1 | |
| 16 | 1987 | 36 | |
| 17 | 1986 | 60 | |
| 18 | 1986 | 15 | |
| 19 | 1985 | 14 | |
| 20 | 1984 | 5 |
About L. Pyber
L. Pyber is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Theoretical Computer Science and Computer Vision and Pattern Recognition, having authored 27 papers that have together received 450 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Limits and Structures in Graph Theory (14 papers), Finite Group Theory Research (10 papers), graph theory and CDMA systems (7 papers), Advanced Topology and Set Theory (5 papers), Graph Labeling and Dimension Problems (5 papers), Graph theory and applications (3 papers) and Digital Image Processing Techniques (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (366 citations), Geometry and Topology (145 citations), Computational Theory and Mathematics (267 citations), Algebra and Number Theory (27 citations) and Computer Graphics and Computer-Aided Design (12 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, Martin W. Liebeck, Paul Erdős, Endre Szemerédi, V. Rödl, Alexandr Kostochka, Aner Shalev, M. N. Ellingham and Péter P. Pálfy. Their work appears in journals such as COMBINATORICA, Journal of Combinatorial Theory Series B, Discrete Mathematics, Journal of Graph Theory and Journal of the London Mathematical Society.
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.