Common graphs with arbitrary connectivity and chromatic number
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ko, Sejin | - |
dc.contributor.author | Lee, Joonkyung | - |
dc.date.accessioned | 2023-08-22T02:57:00Z | - |
dc.date.available | 2023-08-22T02:57:00Z | - |
dc.date.issued | 2023-09 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.issn | 1096-0902 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/189397 | - |
dc.description.abstract | A graph H is common if the number of monochromatic copies of H in a 2-edge-colouring of the complete graph Kn is asymptotically minimised by the random colouring. We prove that, given k,r>0, there exists a k-connected common graph with chromatic number at least r. The result is built upon the recent breakthrough of Kráľ, Volec, and Wei who obtained common graphs with arbitrarily large chromatic number and answers a question of theirs. | - |
dc.format.extent | 8 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | Common graphs with arbitrary connectivity and chromatic number | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1016/j.jctb.2023.06.001 | - |
dc.identifier.scopusid | 2-s2.0-85163888595 | - |
dc.identifier.wosid | 001039324300001 | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.162, pp 223 - 230 | - |
dc.citation.title | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.citation.volume | 162 | - |
dc.citation.startPage | 223 | - |
dc.citation.endPage | 230 | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.subject.keywordPlus | MULTIPLICITIES | - |
dc.subject.keywordAuthor | Ramsey multiplicity | - |
dc.subject.keywordAuthor | Common graphs | - |
dc.subject.keywordAuthor | Graph homomorphism inequalities | - |
dc.subject.keywordAuthor | (Hyper)graph connectivity | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S009589562300045X?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.