Nested cycles with no geometric crossings
Proceedings of the American Mathematical Society, Series B · 2022
DOI: 10.1090/bproc/107 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the American Mathematical Society, Series B, 2022. Verfasst von Irene Fernández und 3 weiteren Autor:innen. Die Arbeit wurde bisher 14-mal zitiert (Crossref) und nennt 16 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 3.0). Gefördert von: Engineering and Physical Sciences Research Council, POSCO TJ Park Foundation, UK Research and Innovation.
Abstract (Originalsprache)
In 1975, Erdős asked the following question: what is the smallest function f ( n ) f(n) for which all graphs with n n vertices and f ( n ) f(n) edges contain two edge-disjoint cycles C 1 C_1 and C 2 C_2 , such that the vertex set of C 2 C_2 is a subset of the vertex set of C 1 C_1 and their cyclic orderings of the vertices respect each other? We prove the optimal linear bound f ( n ) = O ( n ) f(n)=O(n) using sublinear expanders.
Förderung
- Engineering and Physical Sciences Research Council
- POSCO TJ Park Foundation
- UK Research and Innovation
- National Research Foundation of Korea
Zitieren
APA
Fernández, I., Kim, J., Kim, Y., & Liu, H. (2022). Nested cycles with no geometric crossings. Proceedings of the American Mathematical Society, Series B. https://doi.org/10.1090/bproc/107
Vancouver
Fernández I, Kim J, Kim Y, Liu H. Nested cycles with no geometric crossings. Proceedings of the American Mathematical Society, Series B. 2022. doi:10.1090/bproc/107
BibTeX
@article{Fernndez2022,
author = {Fernández, Irene and Kim, Jaehoon and Kim, Younjin and Liu, Hong},
title = {Nested cycles with no geometric crossings},
journal = {Proceedings of the American Mathematical Society, Series B},
year = {2022},
doi = {10.1090/bproc/107}
}
EUVIMED