Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김연진 | - |
dc.date.accessioned | 2022-08-12T16:31:30Z | - |
dc.date.available | 2022-08-12T16:31:30Z | - |
dc.date.issued | 2022 | - |
dc.identifier.issn | 2330-1511 | - |
dc.identifier.other | OAK-32048 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/262455 | - |
dc.description.abstract | In 1975, Erdős asked the following question: what is the smallest function f (n) for which all graphs with n vertices and f (n) edges contain two edge-disjoint cycles C1 and C2, such that the vertex set of C2 is a subset of the vertex set of C1 and their cyclic orderings of the vertices respect each other? We prove the optimal linear bound f (n) = O(n) using sublinear expanders. © 2022 by the authors under Creative Commons Attribution 3.0 License (CC BY 3.0). | - |
dc.language | English | - |
dc.publisher | American Mathematical Society | - |
dc.title | NESTED CYCLES WITH NO GEOMETRIC CROSSINGS | - |
dc.type | Article | - |
dc.relation.volume | 9 | - |
dc.relation.index | SCOPUS | - |
dc.relation.startpage | 22 | - |
dc.relation.lastpage | 32 | - |
dc.relation.journaltitle | Proceedings of the American Mathematical Society, Series B | - |
dc.identifier.doi | 10.1090/bproc/107 | - |
dc.identifier.scopusid | 2-s2.0-85130324351 | - |
dc.author.google | Fernández I.G. | - |
dc.author.google | Kim J. | - |
dc.author.google | Kim Y. | - |
dc.author.google | Liu H. | - |
dc.contributor.scopusid | 김연진(55574123179) | - |
dc.date.modifydate | 20220812100627 | - |