BibTeX record journals/rsa/FoxP21

download as .bib file

@article{DBLP:journals/rsa/FoxP21,
  author       = {Jacob Fox and
                  Cosmin Pohoata},
  title        = {Sets without k-term progressions can have many shorter progressions},
  journal      = {Random Struct. Algorithms},
  volume       = {58},
  number       = {3},
  pages        = {383--389},
  year         = {2021},
  url          = {https://doi.org/10.1002/rsa.20984},
  doi          = {10.1002/RSA.20984},
  timestamp    = {Thu, 25 Mar 2021 18:13:29 +0100},
  biburl       = {https://dblp.org/rec/journals/rsa/FoxP21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.