NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
연구기관
수리과학연구소
Journal papers
View : 508 Download: 0
NESTED CYCLES WITH NO GEOMETRIC CROSSINGS
Title
NESTED CYCLES WITH NO GEOMETRIC CROSSINGS
Authors
Fernández I.G.
;
Kim J.
;
Kim Y.
;
Liu H.
Ewha Authors
김연진
SCOPUS Author ID
김연진
Issue Date
2022
Journal Title
Proceedings of the American Mathematical Society, Series B
ISSN
2330-1511
Citation
Proceedings of the American Mathematical Society, Series B vol. 9, pp. 22 - 32
Publisher
American Mathematical Society
Indexed
SCOPUS
Document Type
Article
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).
DOI
10.1090/bproc/107
Appears in Collections:
연구기관
>
수리과학연구소
>
Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML
Show full item record
Find@EWHA
트윗하기
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject