REGULAR PARTITIONS OF GRAPHS

471 indexed citations

Abstract

loading...

About

This paper, published in 1975, received 471 indexed citations. Written by Endre Szemerédi covering the research area of Discrete Mathematics and Combinatorics and Computational Theory and Mathematics. It is primarily cited by scholars working on Discrete Mathematics and Combinatorics (379 citations), Computational Theory and Mathematics (363 citations) and Geometry and Topology (205 citations). Published in Defense Technical Information Center (DTIC).

In The Last Decade

doi.org/w56892008 →

Countries where authors are citing REGULAR PARTITIONS OF GRAPHS

Specialization
Citations

This map shows the geographic impact of REGULAR PARTITIONS OF GRAPHS. 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 REGULAR PARTITIONS OF GRAPHS with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites REGULAR PARTITIONS OF GRAPHS more than expected).

Fields of papers citing REGULAR PARTITIONS OF GRAPHS

Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of REGULAR PARTITIONS OF GRAPHS. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the REGULAR PARTITIONS OF GRAPHS.

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.

This paper is also available at doi.org/w56892008.

Explore hit-papers with similar magnitude of impact

Rankless by CCL
2026