APA (7th ed.) Citation

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

Chicago Style (17th ed.) Citation

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

MLA (9th ed.) Citation

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.