Erdös–Ko–Rado Theorem—22 Years Later

Article Properties
Refrences
Title Journal Journal Categories Citations Publication Date
Algebraic methods in graph theory, Vol. I, II (Szeged, 1978) 1981
Algebraic methods in graph theory, Vol. I, II (Szeged, 1978) 1981
Studies in foundations and combinatorics 1978
Studies in combinatorics 1978
Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976) 1978
Citations
Title Journal Journal Categories Citations Publication Date
A proof of Frankl–Kupavskii's conjecture on edge‐union condition

Journal of Graph Theory
  • Science: Mathematics
2024
On the star of the family of independent sets in a graph Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
2024
On the Holroyd-Talbot conjecture for sparse graphs Discrete Mathematics
  • Science: Mathematics
2024
On sum-intersecting families of positive integers European Journal of Combinatorics
  • Science: Mathematics
2024
Uniform Hypergraphs under Certain Intersection Constraints between Hyperedges Acta Mathematica Sinica, English Series
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
2023
Citations Analysis
The category Science: Mathematics 84 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled The Erdös-Ko-Rado theorem for vector spaces and was published in 1986. The most recent citation comes from a 2024 study titled On sum-intersecting families of positive integers. This article reached its peak citation in 2018, with 10 citations. It has been cited in 34 different journals, 2% of which are open access. Among related journals, the Discrete Mathematics cited this research the most, with 22 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year