Journal article · 2021 · Open access

Exponential Lower Bound for Berge-Ramsey Problems

Dömötör Pálvölgyi

Graphs and Combinatorics, 37(4), 1433–1435 · Published 14 May 2021 · DOI 10.1007/s00373-021-02328-3

Open PDFView at the publisherCite this paper

In brief

“Exponential Lower Bound for Berge-Ramsey Problems” is a 2021 journal article by Dömötör Pálvölgyi, published in Graphs and Combinatorics. OpenAlex counts 6 citations as of 18 November 2026. It is open access under a CC BY licence: the full text is free to read at Graphs and Combinatorics.

Citations
6
Most cited in
2020 (3)
Field-weighted impact
0.68
References
6
Authors
1

Abstract

We give an exponential lower bound for the smallest $$N$$ N such that no matter how we c-color the edges of a complete $$r$$ r -uniform hypergraph on $$N$$ N vertices, we can always find a monochromatic Berge- $$K_n$$ K n .

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Pálvölgyi, D. (2021). Exponential Lower Bound for Berge-Ramsey Problems. Graphs and Combinatorics, 37(4), 1433–1435. https://doi.org/10.1007/s00373-021-02328-3

MLA 9

Pálvölgyi, Dömötör. “Exponential Lower Bound for Berge-Ramsey Problems.” Graphs and Combinatorics, vol. 37, no. 4, 2021, pp. 1433–1435. https://doi.org/10.1007/s00373-021-02328-3.

Chicago

Pálvölgyi, Dömötör. 2021. “Exponential Lower Bound for Berge-Ramsey Problems.” Graphs and Combinatorics 37 (4): 1433–1435. https://doi.org/10.1007/s00373-021-02328-3.

Harvard

Pálvölgyi, D. (2021) ‘Exponential Lower Bound for Berge-Ramsey Problems’, Graphs and Combinatorics, 37(4), pp. 1433–1435. doi:10.1007/s00373-021-02328-3.

IEEE

D. Pálvölgyi, “Exponential Lower Bound for Berge-Ramsey Problems,” Graphs and Combinatorics, vol. 37, no. 4, pp. 1433–1435, 2021, doi: 10.1007/s00373-021-02328-3.

BibTeX

@article{palvolgyi2021exponential,
  title     = {{Exponential Lower Bound for Berge-Ramsey Problems}},
  author    = {Pálvölgyi, Dömötör},
  journal   = {Graphs and Combinatorics},
  year      = {2021},
  volume    = {37},
  number    = {4},
  pages     = {1433--1435},
  doi       = {10.1007/s00373-021-02328-3},
  url       = {https://doi.org/10.1007/s00373-021-02328-3}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202033
202111
202211
202411

Its field-weighted citation impact is 0.68: it has been cited 0.68 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory

  • hypergraph Ramsey numbers
  • edge coloring
  • exponential lower bounds

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Pálvölgyi, D. (2021). Exponential Lower Bound for Berge-Ramsey Problems. Graphs and Combinatorics, 37(4), 1433–1435. https://doi.org/10.1007/s00373-021-02328-3

How many times has this paper been cited?

6 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at Graphs and Combinatorics: sign in and open the PDF from this page.

Who wrote this paper?

Dömötör Pálvölgyi.

What is the DOI of this paper?

10.1007/s00373-021-02328-3, permanently at https://doi.org/10.1007/s00373-021-02328-3. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.