Skip to main content Accessibility help

Login Alert

Cancel
Log in
×
×
Register
Log In
(0) Cart
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Cited by
  • Crossref logo 8
  • Google Scholar logo
Crossref Citations
Crossref logo
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Paiva, Henrique Mohallem Santos, Priscila Falcão dos Maximo, Marcos R. O. A. and Niemeyer, Lucas 2024. Efficient Lecturer Peer-Assessment Attribution Using Graph Theory and a Novel Greedy Algorithm. IEEE Access, Vol. 12, Issue. , p. 14742.
  • CrossRef
  • Google Scholar
Bradač, Domagoj Methuku, Abhishek and Sudakov, Benny 2024. The Extremal Number of Cycles with All Diagonals. International Mathematics Research Notices, Vol. 2024, Issue. 12, p. 9728.
  • CrossRef
  • Google Scholar
Janzer, Oliver Sudakov, Benny and Tomon, István 2024. Regular Subgraphs of Linear Hypergraphs. International Mathematics Research Notices, Vol. 2024, Issue. 17, p. 12366.
  • CrossRef
  • Google Scholar
Draganić, Nemanja Methuku, Abhishek Munhá Correia, David and Sudakov, Benny 2024. Cycles with many chords. Random Structures & Algorithms, Vol. 65, Issue. 1, p. 3.
  • CrossRef
  • Google Scholar
Janzer, Oliver Sudakov, Benny and Tomon, István 2024. Small Subgraphs with Large Average Degree. Combinatorica, Vol. 44, Issue. 4, p. 785.
  • CrossRef
  • Google Scholar
Girão, António and Hunter, Zach 2025. Induced Subdivisions in K s,s-Free Graphs With Polynomial Average Degree. International Mathematics Research Notices, Vol. 2025, Issue. 4,
  • CrossRef
  • Google Scholar
Du, Xiying and McCarty, Rose 2025. A survey of degree-boundedness. European Journal of Combinatorics, Vol. 129, Issue. , p. 104092.
  • CrossRef
  • Google Scholar
Du, Xiying Girão, António Hunter, Zach McCarty, Rose and Scott, Alex 2025. Induced C4-free subgraphs with large average degree. Journal of Combinatorial Theory, Series B, Vol. 173, Issue. , p. 305.
  • CrossRef
  • Google Scholar
Google Scholar Citations

View all Google Scholar citations for this article.

×
Cambridge University Press

Our Site

  • Accessibility
  • Contact & Help
  • Legal Notices

Quick Links

  • Cambridge Core
  • Cambridge Open Engage
  • Cambridge Aspire website

Our Products

  • Journals
  • Books
  • Elements
  • Textbooks
  • Courseware

Join us online

Please choose a valid location.

  • Rights & Permissions
  • Copyright
  • Privacy Notice
  • Terms of Use
  • Cookies Policy
Cambridge University Press 2025

Cancel
Confirm
×

Save article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Resolution of the Erdős–Sauer problem on regular subgraphs
  • Volume 11
  • Oliver Janzer (a1) and Benny Sudakov (a2)
  • DOI: https://doi.org/10.1017/fmp.2023.19
Please provide your Kindle email.
Available formats Please select a format to save.
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Resolution of the Erdős–Sauer problem on regular subgraphs
  • Volume 11
  • Oliver Janzer (a1) and Benny Sudakov (a2)
  • DOI: https://doi.org/10.1017/fmp.2023.19
Available formats Please select a format to save.
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Resolution of the Erdős–Sauer problem on regular subgraphs
  • Volume 11
  • Oliver Janzer (a1) and Benny Sudakov (a2)
  • DOI: https://doi.org/10.1017/fmp.2023.19
Available formats Please select a format to save.
×
×

Reply to: Submit a response

Contents help
Close Contents help

- No HTML tags allowed
- Web page URLs will display as text only
- Lines and paragraphs break automatically
- Attachments, images or tables are not permitted

Please enter your response.

Your details

Email help
Close Email help

Your email address will be used in order to notify you when your comment has been reviewed by the moderator and in case the author(s) of the article or the moderator need to contact you directly.

Please enter a valid email address.
You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Close Conflicting interests help

Please list any fees and grants from, employment by, consultancy for, shared ownership in or any close relationship with, at any time over the preceding 36 months, any organisation whose interests may be affected by the publication of the response. Please also list any non-financial associations or interests (personal, professional, political, institutional, religious or other) that a reasonable reader would want to know about in relation to the submitted work. This pertains to all the authors of the piece, their spouses or partners.