A graph $G$ is $k$-vertex-critical if $\chi(G)=k$, but $\chi(H)<k$ for every induced subgraph $H$ of $G$. A graph $G$ is $(H_1,H_2,\dots,H_m)$-free if does not contain $H_i$ as an induced subgraph for any $i\in\{1,2,\dots,m\}$.We provide the following dichotomy that for bipartite graphs $H$ and any fixed integer $k\ge 5$ , there are only finitely many $k$-vertex-critical $(P_5,H)$-free graphs if and only if $H$ is $2P_2$-free. This leads us to pose the problem about determining for which graphs $H$ with $\chi(H)\ge 3$ there are infinitely many $k$-vertex-critical $(P_5,H)$-free graphs for all $k\ge 5$. Toward this problem, we show that there only finitely many $k$-vertex-critical $(P_5, K_{s,t}+e)$-free graphs for all $k,s,t\ge 1$, where $K_{s,t}+e$ is a complete bipartite graph plus a single edge. On the other hand, we show that there are infinitely many $k$-vertex-critical $(P_5,\operatorname{net},\operatorname{co-net},\overline{C_5},\overline{C_6},\dots\overline{C_{k-1}})$-free graphs for all $k\ge 5$. We also show that there are only finitely many $k$-vertex-critical $(P_4+\ell P_1,\overline{L(K_{2,n})})$-free graphs for all $\ell,n\ge 0$, providing the largest known subfamily of $(P_4+\ell P_1)$-free graphs to satisfy this property. Our results, together with known results, imply the existence of new polynomial-time certifying algorithms to determine the $k$-colourability of many subfamilies of $P_5$-free and $(P_4+\ell P_1)$-free graphs for fixed $k\ge 5$. Our proof techniques apply a powerful theorem of Chudnovsky, Kim, Oum, and Seymour (2016) on prime graphs that we expect to be of interest and have further applications to bounding the number of $k$-vertex-critical graphs in other hereditary families of graphs.
For graphs $F$, $G$, and $H$, we write $F \to (G, H)$ if every red/blue edge-coloring of $F$ contains either a red copy of $G$ or a blue copy of $H$. The Ramsey number $R(G, H)$ is the smallest integer $N$ such that $K_N \to (G, H)$. Let $H := K_k + nK_h$ be the generalized book graph, and let $G := K_{p+1}(a_1, a_2, \...
A graph is $H$-free if it has no induced subgraph isomorphic to $H$. In 2020, Chudnovsky, Goedgebeur, Schaudt, and Zhong characterized all graphs $H$ such that there are only finitely many minimal obstructions to $3$-colouring $H$-free graphs. In general, the minimal obstructions to $k$-colouring $H$-free graphs are th...
Iain Beaton, Ben Cameron, A. V. van Omme· 0 citations
For a $3$-uniform hypergraph $H$, let $\sigma(H)$ be the minimum over the vertices of $H$ of the spectral radius of the link. Lin, Lu, Yuan and Zhao conjectured that $\sigma(H)>\tfrac{2n}3-2$ forces a perfect matching in a $3$-graph of order $n$ divisible by three, and Lu and Yuan conjectured that $\sigma(H)>\tau(q)$ f...
For a finite graph $H$, a connectivity graph-code is a family $\mathcal C\subseteq 2^{E(H)}$ such that $A\triangle B$ is a connected spanning subgraph of $H$ whenever $A$ and $B$ are distinct members of $\mathcal C$. Let $m(H)$ denote the maximum size of such a family, and let $f(d)$ be the largest integer $q$ for whic...
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...
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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.