Clique-factors in graphs with sublinear -independence number

Jie Han; Ping Hu; Guanghui Wang; Donglei Yang

doi:10.1017/S0963548323000081

Clique-factors in graphs with sublinear -independence number

Jie Han, Ping Hu, Guanghui Wang, Donglei Yang^*

^*Corresponding author for this work

School of Mathematics and Statistics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

Given a graph and an integer, we denote by the maximum size of a -free subset of vertices in. A recent question of Nenadov and Pehova asks for determining the best possible minimum degree conditions forcing clique-factors in -vertex graphs with, which can be seen as a Ramsey-Turán variant of the celebrated Hajnal-Szemerédi theorem. In this paper we find the asymptotical sharp minimum degree threshold for -factors in -vertex graphs with for all.

Original language	English
Pages (from-to)	665-681
Number of pages	17
Journal	Combinatorics Probability and Computing
Volume	32
Issue number	4
DOIs	https://doi.org/10.1017/S0963548323000081
Publication status	Published - 24 Jul 2023

Keywords

Clique-factor
Ramsey-Turán

Access to Document

10.1017/S0963548323000081

Cite this

@article{31b5a3d2c7e744d9a64cb6d0c3b6972a,

title = "Clique-factors in graphs with sublinear -independence number",

abstract = "Given a graph and an integer, we denote by the maximum size of a -free subset of vertices in. A recent question of Nenadov and Pehova asks for determining the best possible minimum degree conditions forcing clique-factors in -vertex graphs with, which can be seen as a Ramsey-Tur{\'a}n variant of the celebrated Hajnal-Szemer{\'e}di theorem. In this paper we find the asymptotical sharp minimum degree threshold for -factors in -vertex graphs with for all.",

keywords = "Clique-factor, Ramsey-Tur{\'a}n",

author = "Jie Han and Ping Hu and Guanghui Wang and Donglei Yang",

note = "Publisher Copyright: {\textcopyright} 2023 The Author(s). Published by Cambridge University Press.",

year = "2023",

month = jul,

day = "24",

doi = "10.1017/S0963548323000081",

language = "English",

volume = "32",

pages = "665--681",

journal = "Combinatorics Probability and Computing",

issn = "0963-5483",

publisher = "Cambridge University Press",

number = "4",

}

TY - JOUR

T1 - Clique-factors in graphs with sublinear -independence number

AU - Han, Jie

AU - Hu, Ping

AU - Wang, Guanghui

AU - Yang, Donglei

PY - 2023/7/24

Y1 - 2023/7/24

N2 - Given a graph and an integer, we denote by the maximum size of a -free subset of vertices in. A recent question of Nenadov and Pehova asks for determining the best possible minimum degree conditions forcing clique-factors in -vertex graphs with, which can be seen as a Ramsey-Turán variant of the celebrated Hajnal-Szemerédi theorem. In this paper we find the asymptotical sharp minimum degree threshold for -factors in -vertex graphs with for all.

AB - Given a graph and an integer, we denote by the maximum size of a -free subset of vertices in. A recent question of Nenadov and Pehova asks for determining the best possible minimum degree conditions forcing clique-factors in -vertex graphs with, which can be seen as a Ramsey-Turán variant of the celebrated Hajnal-Szemerédi theorem. In this paper we find the asymptotical sharp minimum degree threshold for -factors in -vertex graphs with for all.

KW - Clique-factor

KW - Ramsey-Turán

UR - http://www.scopus.com/inward/record.url?scp=85177214224&partnerID=8YFLogxK

U2 - 10.1017/S0963548323000081

DO - 10.1017/S0963548323000081

M3 - Article

AN - SCOPUS:85177214224

SN - 0963-5483

VL - 32

SP - 665

EP - 681

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

IS - 4

ER -

Clique-factors in graphs with sublinear -independence number

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this