DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chudnovsky, Maria | ko |
dc.contributor.author | Oum, Sang-il | ko |
dc.date.accessioned | 2018-11-22T06:41:07Z | - |
dc.date.available | 2018-11-22T06:41:07Z | - |
dc.date.created | 2018-11-13 | - |
dc.date.created | 2018-11-13 | - |
dc.date.created | 2018-11-13 | - |
dc.date.created | 2018-11-13 | - |
dc.date.issued | 2018-12 | - |
dc.identifier.citation | DISCRETE MATHEMATICS, v.341, no.12, pp.3498 - 3499 | - |
dc.identifier.issn | 0012-365X | - |
dc.identifier.uri | http://hdl.handle.net/10203/246681 | - |
dc.description.abstract | We prove that for every graph H, there exists epsilon > 0 such that every n-vertex graph with no vertex-minors isomorphic to H has a pair of disjoint sets A, B of vertices such that vertical bar A vertical bar, vertical bar B vertical bar >= epsilon n and A is complete or anticomplete to B. We deduce this from recent work of Chudnovsky, Scott, Seymour, and Spirkl (2018). This proves the analog of the Erclas-Hajnal conjecture for vertex-minors. (C) 2018 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Vertex-minors and the Erdos-Hajnal conjecture | - |
dc.type | Article | - |
dc.identifier.wosid | 000448496500022 | - |
dc.identifier.scopusid | 2-s2.0-85053924305 | - |
dc.type.rims | ART | - |
dc.citation.volume | 341 | - |
dc.citation.issue | 12 | - |
dc.citation.beginningpage | 3498 | - |
dc.citation.endingpage | 3499 | - |
dc.citation.publicationname | DISCRETE MATHEMATICS | - |
dc.identifier.doi | 10.1016/j.disc.2018.09.007 | - |
dc.contributor.localauthor | Oum, Sang-il | - |
dc.contributor.nonIdAuthor | Chudnovsky, Maria | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Vertex-minor | - |
dc.subject.keywordAuthor | Erdos-Hajnal conjecture | - |
dc.subject.keywordPlus | CROSSING PATTERNS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.