For integers $k>\ell\ge0$, a graph $G$ is $(k,\ell)$-stable if $α(G-S)\geq α(G)-\ell$ for every $S\subseteq V(G)$ with $|S|=k$. A recent result of Dong and Wu [SIAM J. Discrete Math., 36 (2022) 229--240] shows that every $(k,\ell)$-stable graph $G$ satisfies $α(G) \le \lfloor ({|V(G)|-k+1})/{2}\rfloor+\ell$. A $(k,\ell)$-stable graph $G$ is tight if $α(G) = \lfloor ({|V(G)|-k+1})/{2}\rfloor+\ell$; and $q$-tight for some integer $q\ge0$ if $α(G) = \lfloor ({|V(G)|-k+1})/{2}\rfloor+\ell-q$. In this paper, we first prove that for all $k\geq 24$, the only tight $(k, 0)$-stable graphs are $K_{k+1}$ and $K_{k+2}$, answering a question of Dong and Luo [arXiv: 2401.16639]. We then prove that for all nonnegative integers $k, \ell, q$ with $k\geq 3\ell+3$, every $q$-tight $(k,\ell)$-stable graph has at most $k-3\ell-3+2^{3(\ell+2q+4)^2}$ vertices, answering a question of Dong and Luo in the negative.
A Jump in the Codegree Turán Densities of Long Tight Cycles
University of Illinois Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校);Institute for Basic Science (IBS)(韩国基础科学研究所);University of Illinois Chicago(伊利诺伊大学芝加哥分校);Institute for Advanced Study(普林斯顿高等研究院)
School of Mathematical Sciences, University of Science and Technology of China(中国科学技术大学数学科学学院);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心)
Enumeration of maps with tight boundaries and the Zhukovsky transformation
Sorbonne Université(索邦大学);Université Paris Cité(巴黎西岱大学);CNRS, IMJ-PRG(法国国家科学研究中心,IMJ-PRG);Université Paris-Saclay(巴黎萨克雷大学);CEA, Institut de physique théorique(法国原子能委员会,理论物理研究所);ENS de Lyon(里昂高等师范学校);Institut Universitaire de France(法兰西学院)