Jan Hladký
- Discrete Mathematics and Combinatorics top 2%
- Computational Theory and Mathematics top 5%
- Geometry and Topology top 5%
- Electrical and Electronic Engineering
- Epidemiology
- Co-authors
- Daniel Král͏̌Serguei NorineAlexander RazborovHamed HatamiJulia BöttcherSergey NorinPeter AllenAnusch Taraz
- Topics
- Limits and Structures in Graph Theory (28 papers)Advanced Graph Theory Research (20 papers)Graph theory and applications (15 papers)
- Cited by
- Discrete Mathematics and CombinatoricsGeometry and TopologyComputational Theory and Mathematics
- Journals
- Transactions of the American Mathematical SocietyAdvances in MathematicsDiscrete Mathematics
- Partner nations
- CzechiaUnited KingdomGermany
In The Last Decade
Jan Hladký
30 papers receiving 228 citations
Peers
Comparison fields: 5 of 27
- Discrete Mathematics and Combinatorics 195
- Computational Theory and Mathematics 189
- Geometry and Topology 122
- Electrical and Electronic Engineering 41
- Epidemiology 12
Countries citing papers authored by Jan Hladký
This map shows the geographic impact of Jan Hladký'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 Jan Hladký with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jan Hladký more than expected).
Fields of papers citing papers by Jan Hladký
This network shows the impact of papers produced by Jan Hladký. 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 Jan Hladký. The network helps show where Jan Hladký may publish in the future.
Co-authorship network of co-authors of Jan Hladký
This figure shows the co-authorship network connecting the top 25 collaborators of Jan Hladký. A scholar is included among the top collaborators of Jan Hladký based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jan Hladký. Jan Hladký is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 12 | |
| 3 | 7 | |
| 4 | 0 | |
| 5 | Theory of limits of sequences of Latin squares | 1 |
| 6 | 0 | |
| 7 | 5 | |
| 8 | 3 | |
| 9 | 4 | |
| 10 | 6 | |
| 11 | 2 | |
| 12 | 1 | |
| 13 | A Combinatorial Proof Of Rayleigh Monotonicity For Graphs. | 0 |
| 14 | 66 | |
| 15 | 11 | |
| 16 | 26 | |
| 17 | 9 | |
| 18 | 21 | |
| 19 | Note on bipartite graph tilings | 5 |
| 20 | 0 |
About Jan Hladký
Jan Hladký is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics, having authored 35 papers that have together received 242 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (28 papers), Advanced Graph Theory Research (20 papers) and Graph theory and applications (15 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (195 citations), Geometry and Topology (122 citations) and Computational Theory and Mathematics (189 citations). Jan Hladký has collaborated with scholars based in Czechia, United Kingdom and Germany. Frequent co-authors include Daniel Král͏̌, Serguei Norine, Alexander Razborov, Hamed Hatami, Julia Böttcher, Sergey Norin, Peter Allen, Anusch Taraz, Mathias Schacht and Endre Szemerédi. Their work appears in journals such as Transactions of the American Mathematical Society, Advances in Mathematics and Discrete Mathematics.
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.