Near-perfect clique-factors in sparse pseudorandom graphs

DOI10.1016/j.endm.2018.06.038zbMath1397.05093arXiv1806.00493MaRDI QIDQ1792104

Yoshiharu Kohayakawa, Yury Person, Jie Han

Publication date: 11 October 2018

Full work available at URL: https://arxiv.org/abs/1806.00493

zbMATH Keywords

pseudorandomness; \((n,d, \lambda)\)-graphs; clique-factors

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

05C42: Density (toughness, etc.)