For a graph $\Gamma=(V,E)$ and nonnegative integers $a$ and $b$, a nonempty proper subset $C \subset V$ is called an $(a,b)$-regular set if every vertex in $C$ has exactly $a$ neighbors in $C$, and every vertex in $V\setminus C$ has exactly $b$ neighbors in $C$. In this paper, we study the existence of such sets in connected Cayley graph $\Gamma = \operatorname{Cay}(\mathbb{Z}_n, S)$. We establish a necessary and sufficient condition for the existence of $(0, |S|)$-regular sets and identify additional conditions under which no such set can exist. We further prove that $(|S|, 0)$-regular sets do not occur in $\Gamma$, and more generally, that no connected Cayley graph $\operatorname{Cay}(G,S)$ contains a $(1, |S|)$-regular set. As a main result, we determine the existence and nonexistence of $(a,b)$-regular sets in connected circulant quartic graphs for all possible values of $a$ and $b$.
A graph $G$ is $n$-existentially closed or $n$-e.c. if, for all subsets $S\subseteq V(G)$ with $|S|=n$ and for all partitions $S=A\sqcup B$, there exists a vertex in $V(G)\setminus S$ adjacent to all vertices in $A$ and no vertices in $B$. We study the minimum number of edges $m(v,n)$ of a $v$-vertex $n$-e.c. graph, an...
Isabel T. Byrne, John Byrne, S. Cioabă· 0 citations
Kahn proved that, among bipartite $d$-regular graphs on $n$ vertices, the number of independent sets is maximized by a disjoint union of copies of $K_{d,d}$. Zhao later extended this result to all $d$-regular graphs. We prove a robust version of this theorem in which independent sets are replaced by sets spanning few i...
For a graph $G$, let $e(G)$ denote the number of edges of $G$, and let $c(G)$ be the number of distinct cycles in $G$. Morrison, Roberts and Scott asked whether, for every fixed graph $H$ and all large $n$, some $n$-vertex $H$-free graph maximizes both $e(G)$ and $c(G)$. In this paper, we show that the answer is no for...
Let $\mathbf{G}=\{G_1,\dots,G_{n}\}$ be a collection of not necessarily distinct $n$-vertex graphs with a common vertex set $V$. A cycle $C$ with $V(C)\subseteq V$ and $|E(C)|\leq n$ is called \emph{rainbow} in $\mathbf{G}$, if there exists an injection $\phi\colon E(C)\to [n]$ such that $e\in E(G_{\phi(e)})$ for each...
An $n$-vertex graph $G$ is $(\rho, d)$-dense if for all $U \subseteq V(G)$ of size at least $\rho n$, the induced subgraph $G[U]$ contains at least $\frac{d}{2}|U|^2$ edges. In 2010, partly motivated by the theory of quasirandomness, Kohayakawa, Nagle, R\"{o}dl, and Schacht conjectured that, for any fixed graph $F$, th...
For a graph $G$ and a set $B\subseteq V(G)$, the spread $\mathrm{sp}(B)$ of $B$ is the difference between the largest and the smallest degree in $G$ of a vertex of $B$, and for an integer $k\geq 0$ the parameter $\mathrm{sp}(G,k)$ is the largest cardinality of a set $B$ with $\mathrm{sp}(B)\leq k$. Caro, Lauri and Zarb...
Y. Caro, R. Škrekovski, Christina Zarb· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.