DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chang, Fan | ko |
dc.contributor.author | Han, Jie | ko |
dc.contributor.author | Kim, Jaehoon | ko |
dc.contributor.author | Wang, Guanghui | ko |
dc.contributor.author | Yang, Donglei | ko |
dc.date.accessioned | 2023-07-10T02:00:09Z | - |
dc.date.available | 2023-07-10T02:00:09Z | - |
dc.date.created | 2023-07-08 | - |
dc.date.created | 2023-07-08 | - |
dc.date.issued | 2023-07 | - |
dc.identifier.citation | JOURNAL OF COMBINATORIAL THEORY SERIES B, v.161, pp.301 - 330 | - |
dc.identifier.issn | 0095-8956 | - |
dc.identifier.uri | http://hdl.handle.net/10203/310395 | - |
dc.description.abstract | The following question was proposed by Nenadov and Pehova and reiterated by Knierim and Su: given μ>0 and integers ℓ,r and n with n∈rN, is it true that there exists an α>0 such that every n-vertex graph G with [Formula presented] and αℓ(G)≤αn contains a Kr-factor? We give a negative answer to this question for the case [Formula presented] by giving a family of constructions using the so-called cover thresholds and show that the minimum degree condition given by our construction is asymptotically best possible. That is, for all integers r,ℓ with [Formula presented] and μ>0, there exist α>0 and N such that for every n∈rN with n>N, every n-vertex graph G with [Formula presented] and αℓ(G)≤αn contains a Kr-factor. Here ϱℓ(r−1) is the Ramsey–Turán density for Kr−1 under the ℓ-independence number condition. | - |
dc.language | English | - |
dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
dc.title | Embedding clique-factors in graphs with low ℓ-independence number | - |
dc.type | Article | - |
dc.identifier.wosid | 001004213300001 | - |
dc.identifier.scopusid | 2-s2.0-85150825517 | - |
dc.type.rims | ART | - |
dc.citation.volume | 161 | - |
dc.citation.beginningpage | 301 | - |
dc.citation.endingpage | 330 | - |
dc.citation.publicationname | JOURNAL OF COMBINATORIAL THEORY SERIES B | - |
dc.identifier.doi | 10.1016/j.jctb.2023.02.008 | - |
dc.contributor.localauthor | Kim, Jaehoon | - |
dc.contributor.nonIdAuthor | Chang, Fan | - |
dc.contributor.nonIdAuthor | Han, Jie | - |
dc.contributor.nonIdAuthor | Wang, Guanghui | - |
dc.contributor.nonIdAuthor | Yang, Donglei | - |
dc.description.isOpenAccess | N | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | H-factor | - |
dc.subject.keywordAuthor | Regularity method | - |
dc.subject.keywordAuthor | Absorbing method | - |
dc.subject.keywordAuthor | Ramsey-Turan problem | - |
dc.subject.keywordPlus | PERFECT MATCHINGS | - |
dc.subject.keywordPlus | TURAN | - |
dc.subject.keywordPlus | CONJECTURE | - |
dc.subject.keywordPlus | VERSION | - |
dc.subject.keywordPlus | PROOF | - |
dc.subject.keywordPlus | SETS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.