BROWSE

Related Scientist

kevin,hendrey's photo.

kevin,hendrey
이산수학그룹
more info

ITEM VIEW & DOWNLOAD

Extremal functions for sparse minors

DC Field Value Language
dc.contributor.authorHendrey Kevin-
dc.contributor.authorSergey Norin-
dc.contributor.authorDavid R. Wood-
dc.date.accessioned2023-04-20T22:00:13Z-
dc.date.available2023-04-20T22:00:13Z-
dc.date.created2023-04-17-
dc.date.issued2022-07-
dc.identifier.urihttps://pr.ibs.re.kr/handle/8788114/13254-
dc.description.abstract<jats:p>The notion of a graph minor, which generalizes graph subgraphs, is a central notion of modern graph theory. Classical results concerning graph minors include the Graph Minor Theorem and the Graph Structure Theorem, both due to Robertson and Seymour. The results concern properties of classes of graphs closed under taking minors; such graph classes include many important natural classes of graphs, e.g., the class of planar graphs and, more generally, the class of graphs embeddable in a fixed surface. The Graph Minor Theorem asserts that every class of graphs closed under taking minors has a finite list of forbidden minors. For example, Wagner’s Theorem, which claims that a graph is planar if and only if it does not contain or as a minor, is a particular case of this theorem. The Graph Structure Theorem asserts that graphs from a fixed class of graphs closed under taking minors can be decomposed in a tree-like fashion into graphs almost embeddable in a fixed surface. In particular, every graph in a class of graphs avoiding a fixed minor admits strongly sublinear separators (the Planar separator theorem of Lipton and Tarjan is a special case of this more general result). As the number of edges of every graph contained in a class of graphs closed under taking minors is linear in the number of its vertices, one can define to be the maximum possible density of a graph that does not contain a graph as a minor. This quantity has been a subject of very intensive research; for example, a long list of bounds concerning culminated with a result of Thomason in 2001, who precisely determined its asymptotic behavior. This paper provides bounds on when itself is from a class of sparse graphs. In particular, the authors prove an asymptotically tight bound on in terms of the number of vertices of and the ratio of the vertex cover and the number of vertices of graphs contained in a class of graphs with strongly sublinear separators.</jats:p>-
dc.language영어-
dc.publisherAlliance of Diamond Open Access Journals-
dc.titleExtremal functions for sparse minors-
dc.typeArticle-
dc.type.rimsART-
dc.identifier.scopusid2-s2.0-85138604340-
dc.identifier.rimsid80537-
dc.contributor.affiliatedAuthorHendrey Kevin-
dc.identifier.doi10.19086/aic.2022.5-
dc.identifier.bibliographicCitationAdvances in Combinatorics, v.2022, no.1, pp.1 - 43-
dc.relation.isPartOfAdvances in Combinatorics-
dc.citation.titleAdvances in Combinatorics-
dc.citation.volume2022-
dc.citation.number1-
dc.citation.startPage1-
dc.citation.endPage43-
dc.description.journalClass1-
dc.description.journalClass1-
dc.description.isOpenAccessN-
dc.description.journalRegisteredClassscopus-
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse