192 results on '"Feghali, Carl"'
Search Results
2. Beyond recognizing well-covered graphs
- Author
-
Feghali, Carl, Marin, Malory, and Watrigant, Rémi
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics - Abstract
We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said - $\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex sets $A_1, \dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \dots,S_k$ in $G$ such that $A_i \subseteq S_i$ for $i \in [k]$. - $\mathbf{E_s}$ if every independent set in $G$ of size at most $s$ is contained in a maximum independent set in $G$. Chv\'atal and Slater (1993) and Sankaranarayana and Stewart (1992) famously showed that recognizing $\mathbf{W_1}$ graphs or, equivalently, well-covered graphs is coNP-complete. We extend this result by showing that recognizing $\mathbf{W_{k+1}}$ graphs in either $\mathbf{W_k}$ or $\mathbf{E_s}$ graphs is coNP-complete. This answers a question of Levit and Tankus (2023) and strengthens a theorem of Feghali and Marin (2024). We also show that recognizing $\mathbf{E_{s+1}}$ graphs is $\Theta_2^p$-complete even in $\mathbf{E_s}$ graphs, where $\Theta_2^p = \text{P}^{\text{NP}[\log]}$ is the class of problems solvable in polynomial time using a logarithmic number of calls to a SAT oracle. This strengthens a theorem of Berg\'e, Busson, Feghali and Watrigant (2023). We also obtain the complete picture of the complexity of recognizing chordal $\mathbf{W_k}$ and $\mathbf{E_s}$ graphs which, in particular, simplifies and generalizes a result of Dettlaff, Henning and Topp (2023)., Comment: Preliminary version
- Published
- 2024
3. Graphs without a 3-connected subgraph are 4-colorable
- Author
-
Bonnet, Édouard, Feghali, Carl, Nguyen, Tung, Scott, Alex, Seymour, Paul, Thomassé, Stéphan, and Trotignon, Nicolas
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C15, 05C40 ,G.2.2 - Abstract
In 1972, Mader showed that every graph without a 3-connected subgraph is 4-degenerate and thus 5-colorable}. We show that the number 5 of colors can be replaced by 4, which is best possible., Comment: 13 pages
- Published
- 2024
4. Solution to a Problem of Grünbaum on the Edge Density of 4-Critical Planar Graphs
- Author
-
Dvořák, Zdeněk and Feghali, Carl
- Published
- 2024
- Full Text
- View/download PDF
5. Solution to a problem of Gr\'unbaum on the edge density of $4$-critical planar graphs
- Author
-
Dvořák, Zdeněk and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05C10 - Abstract
We show that $\limsup |E(G)|/|V(G)| = 2.5$ over all $4$-critical planar graphs $G$, answering a question of Gr\"unbaum from 1988., Comment: 14 pages, 7 figures
- Published
- 2023
6. 1-Extendability of Independent Sets
- Author
-
Bergé, Pierre, Busson, Anthony, Feghali, Carl, and Watrigant, Rémi
- Published
- 2024
- Full Text
- View/download PDF
7. Three remarks on $\mathbf{W_2}$ graphs
- Author
-
Feghali, Carl and Marin, Malory
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C69 - Abstract
Let $k \geq 1$. A graph $G$ is $\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex subsets $A_1, \dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \dots, S_k$ in $G$ such that $A_i \subseteq S_i$ for $i \in [k]$. Recognizing $\mathbf{W_1}$ graphs is co-NP-hard, as shown by Chv\'atal and Slater (1993) and, independently, by Sankaranarayana and Stewart (1992). Extending this result and answering a recent question of Levit and Tankus, we show that recognizing $\mathbf{W_k}$ graphs is co-NP-hard for $k \geq 2$. On the positive side, we show that recognizing $\mathbf{W_k}$ graphs is, for each $k\geq 2$, FPT parameterized by clique-width and by tree-width. Finally, we construct graphs $G$ that are not $\mathbf{W_2}$ such that, for every vertex $v$ in $G$ and every maximal independent set $S$ in $G - N[v]$, the largest independent set in $N(v) \setminus S$ consists of a single vertex, thereby refuting a conjecture of Levit and Tankus., Comment: 7 pages
- Published
- 2023
8. Dirac's theorem on chordal graphs implies Brooks' theorem
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
We give yet another proof of the list-color version of Brooks' theorem that is due, independently, to Vizing and to Erd\H{o}s, Rubin and Taylor, via a famous theorem of Dirac on chordal graphs., Comment: 2 pages
- Published
- 2023
9. Kempe Classes and Almost Bipartite Graphs
- Author
-
Cranston, Daniel W. and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
Let $G$ be a graph and $k$ be a positive integer, and let $Kc(G, k)$ denote the number of Kempe equivalence classes for the $k$-colorings of $G$. In 2006, Mohar noted that $Kc(G, k) = 1$ if $G$ is bipartite. As a generalization, we show that $Kc(G, k) = 1$ if $G$ is formed from a bipartite graph by adding any number of edges less than $\binom{\lceil k/2\rceil}2+\binom{\lfloor k/2\rfloor}2$. We show that our result is tight (up to lower order terms) by constructing, for each $k \geq 8$, a graph $G$ formed from a bipartite graph by adding $(k^2+8k-45+1)/4$ edges such that $Kc(G, k) \geq 2$. This refutes a recent conjecture of Higashitani--Matsumoto., Comment: 7 pages, 2 figures; 2nd version incorporates reviewer feedback
- Published
- 2023
10. Matching Cuts in Graphs of High Girth and H-Free Graphs
- Author
-
Feghali, Carl, Lucke, Felicia, Paulusma, Daniel, and Ries, Bernard
- Subjects
Mathematics - Combinatorics ,Computer Science - Computational Complexity ,Computer Science - Discrete Mathematics ,Computer Science - Data Structures and Algorithms - Abstract
The (Perfect) Matching Cut problem is to decide if a connected graph has a (perfect) matching that is also an edge cut. The Disconnected Perfect Matching problem is to decide if a connected graph has a perfect matching that contains a matching cut. Both Matching Cut and Disconnected Perfect Matching are NP-complete for planar graphs of girth 5, whereas Perfect Matching Cut is known to be NP-complete even for subcubic bipartite graphs of arbitrarily large fixed girth. We prove that Matching Cut and Disconnected Perfect Matching are also NP-complete for bipartite graphs of arbitrarily large fixed girth and bounded maximum degree. Our result for Matching Cut resolves a 20-year old open problem. We also show that the more general problem $d$-Cut, for every fixed $d \geq 1$, is NP-complete for bipartite graphs of arbitrarily large fixed girth and bounded maximum degree. Furthermore, we show that Matching Cut, Perfect Matching Cut and Disconnected Perfect Matching are NP-complete for $H$-free graphs whenever $H$ contains a connected component with two vertices of degree at least 3. Afterwards, we update the state-of-the-art summaries for $H$-free graphs and compare them with each other, and with a known and full classification of the Maximum Matching Cut problem, which is to determine a largest matching cut of a graph $G$. Finally, by combining existing results, we obtain a complete complexity classification of Perfect Matching Cut for $H$-subgraph-free graphs where $H$ is any finite set of graphs.
- Published
- 2022
11. Kempe Equivalent List Colorings Revisited
- Author
-
Chakraborty, Dibyayan, Feghali, Carl, and Mahmoud, Reem
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
A \emph{Kempe chain} on colors $a$ and $b$ is a component of the subgraph induced by colors $a$ and $b$. A \emph{Kempe change} is the operation of interchanging the colors of some Kempe chain. For a list-assignment $L$ and an $L$-coloring $\varphi$, a Kempe change is \emph{$L$-valid} for $\varphi$ if performing the Kempe change yields another $L$-coloring. Two $L$-colorings are \emph{$L$-equivalent} if we can form one from the other by a sequence of $L$-valid Kempe changes. A \emph{degree-assignment} is a list-assignment $L$ such that $L(v)\ge d(v)$ for every $v\in V(G)$. Cranston and Mahmoud (\emph{Combinatorica}, 2023) asked: For which graphs $G$ and degree-assignment $L$ of $G$ is it true that all the $L$-colorings of $G$ are $L$-equivalent? We prove that for every 4-connected graph $G$ which is not complete and every degree-assignment $L$ of $G$, all $L$-colorings of $G$ are $L$-equivalent., Comment: 12 pages; major changes in presentation
- Published
- 2022
12. Solution to a problem of Katona on counting cliques of weighted graphs
- Author
-
Borg, Peter, Feghali, Carl, and Pellerin, Rémi
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05D05, 05C35, 05C69 - Abstract
A subset $I$ of the vertex set $V(G)$ of a graph $G$ is called a $k$-clique independent set of $G$ if no $k$ vertices in $I$ form a $k$-clique of $G$. An independent set is a $2$-clique independent set. Let $\pi_k(G)$ denote the number of $k$-cliques of $G$. For a function $w: V(G) \rightarrow \{0, 1, 2, \dots\}$, let $G(w)$ be the graph obtained from $G$ by replacing each vertex $v$ by a $w(v)$-clique $K^v$ and making each vertex of $K^u$ adjacent to each vertex of $K^v$ for each edge $\{u,v\}$ of $G$. For an integer $m \geq 1$, consider any $w$ with $\sum_{v \in V(G)} w(v) = m$. For $U \subseteq V(G)$, we say that $w$ is uniform on $U$ if $w(v) = 0$ for each $v \in V(G) \setminus U$ and, for each $u \in U$, $w(u) = \left\lfloor m/|U| \right\rfloor$ or $w(u) = \left\lceil m/|U| \right\rceil$. Katona asked if $\pi_k(G(w))$ is smallest when $w$ is uniform on a largest $k$-clique independent set of $G$. He placed particular emphasis on the Sperner graph $B_n$, given by $V(B_n) = \{X \colon X \subseteq \{1, \dots, n\}\}$ and $E(B_n) = \{\{X,Y\} \colon X \subsetneq Y \in V(B_n)\}$. He provided an affirmative answer for $k = 2$ (and any $G$). We determine graphs for which the answer is negative for every $k \geq 3$. These include $B_n$ for $n \geq 2$. Generalizing Sperner's Theorem and a recent result of Qian, Engel and Xu, we show that $\pi_k(B_n(w))$ is smallest when $w$ is uniform on a largest independent set of $B_n$. We also show that the same holds for complete multipartite graphs and chordal graphs. We show that this is not true of every graph, using a deep result of Bohman on triangle-free graphs., Comment: 14 pages, minor corrections made
- Published
- 2022
13. Partitioning into degenerate graphs in linear time
- Author
-
Corsini, Timothée, Deschamps, Quentin, Feghali, Carl, Gonçalves, Daniel, Langlois, Hélène, and Talon, Alexandre
- Subjects
Mathematics - Combinatorics ,Computer Science - Data Structures and Algorithms ,05C15 - Abstract
Let $G$ be a connected graph with maximum degree $\Delta \geq 3$ distinct from $K_{\Delta + 1}$. Generalizing Brooks' Theorem, Borodin, Kostochka and Toft proved that if $p_1, \dots, p_s$ are non-negative integers such that $p_1 + \dots + p_s \geq \Delta - s$, then $G$ admits a vertex partition into parts $A_1, \dots, A_s$ such that, for $1 \leq i \leq s$, $G[A_i]$ is $p_i$-degenerate. Here we show that such a partition can be performed in linear time. This generalizes previous results that treated subcases of a conjecture of Abu-Khzam, Feghali and Heggernes~\cite{abu2020partitioning}, which our result settles in full., Comment: 12 pages, 4 figures, 5 algorithms
- Published
- 2022
14. 1-Extendability of independent sets
- Author
-
Bergé, Pierre, Busson, Anthony, Feghali, Carl, and Watrigant, Rémi
- Subjects
Computer Science - Computational Complexity ,Computer Science - Data Structures and Algorithms - Abstract
In the 70s, Berge introduced 1-extendable graphs (also called B-graphs), which are graphs where every vertex belongs to a maximum independent set. Motivated by an application in the design of wireless networks, we study the computational complexity of 1-extendability, the problem of deciding whether a graph is 1-extendable. We show that, in general, 1-extendability cannot be solved in $2^{o(n)}$ time assuming the Exponential Time Hypothesis, where $n$ is the number of vertices of the input graph, and that it remains NP-hard in subcubic planar graphs and in unit disk graphs (which is a natural model for wireless networks). Although 1-extendability seems to be very close to the problem of finding an independent set of maximum size (a.k.a. Maximum Independent Set), we show that, interestingly, there exist 1-extendable graphs for which Maximum Independent Set is NP-hard. Finally, we investigate a parameterized version of 1-extendability., Comment: Extended abstract in IWOCA 2022
- Published
- 2022
15. Strengthening a theorem of Meyniel
- Author
-
Deschamps, Quentin, Feghali, Carl, Kardoš, František, Legrand-Duchesne, Clément, and Pierron, Théo
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics - Abstract
For an integer $k \geq 1$ and a graph $G$, let $\mathcal{K}_k(G)$ be the graph that has vertex set all proper $k$-colorings of $G$, and an edge between two vertices $\alpha$ and~$\beta$ whenever the coloring~$\beta$ can be obtained from $\alpha$ by a single Kempe change. A theorem of Meyniel from 1978 states that $\mathcal{K}_5(G)$ is connected with diameter $O(5^{|V(G)|})$ for every planar graph $G$. We significantly strengthen this result, by showing that there is a positive constant $c$ such that $\mathcal{K}_5(G)$ has diameter $O(|V(G)|^c)$ for every planar graph $G$., Comment: 9 pages, 1 figure
- Published
- 2022
16. Recolouring planar graphs of girth at least five
- Author
-
Bartier, Valentin, Bousquet, Nicolas, Feghali, Carl, Heinrich, Marc, Moore, Benjamin, and Pierron, Théo
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
For a positive integer $k$, the $k$-recolouring graph of a graph $G$ has as vertex set all proper $k$-colourings of $G$ with two $k$-colourings being adjacent if they differ by the colour of exactly one vertex. A result of Dyer et al. regarding graphs of bounded degeneracy implies that the $7$-recolouring graphs of planar graphs, the $5$-recolouring graphs of triangle-free planar graphs and the $4$-recolouring graphs planar graphs of girth at least six are connected. On the other hand, there are planar graphs whose $6$-recolouring graph is disconnected, triangle-free planar graphs whose $4$-recolouring graph is disconnected and planar graphs of any given girth whose $3$-recolouring graph is disconnected. The main result of this paper consists in showing, via a novel application of the discharging method, that the $4$-recolouring graph of every planar graph of girth five is connected. This completes the classification of the connectedness of the recolouring graph for planar graphs of given girth. We also prove some theorems regarding the diameter of the recolouring graph of planar graphs., Comment: 21 pages
- Published
- 2021
17. A note on Matching-Cut in $P_t$-free Graphs
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,Computer Science - Data Structures and Algorithms ,05C69 - Abstract
A matching-cut of a graph is an edge cut that is a matching. The problem Matching-Cut is that of recognizing graphs with a matching-cut and is NP-complete, even if the graph belongs to one of a number of classes. We initiate the study of Matching-Cut for graphs without a fixed path as an induced subgraph. We show that Matching-Cut is in P for $P_5$-free graphs, but that there exists an integer $t > 0$ for which it is NP-complete for $P_{t}$-free graphs., Comment: 7 pages, 3 figures; incorporated referees' suggestions
- Published
- 2021
18. Mixing colourings in $2K_2$-free graphs
- Author
-
Feghali, Carl and Merkel, Owen
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C15 - Abstract
The reconfiguration graph for the $k$-colourings of a graph $G$, denoted $R_{k}(G)$, is the graph whose vertices are the $k$-colourings of $G$ and two colourings are joined by an edge if they differ in colour on exactly one vertex. For any $k$-colourable $P_4$-free graph $G$, Bonamy and Bousquet proved that $R_{k+1}(G)$ is connected. In this short note, we complete the classification of the connectedness of $R_{k+1}(G)$ for a $k$-colourable graph $G$ excluding a fixed path, by constructing a $7$-chromatic $2K_2$-free (and hence $P_5$-free) graph admitting a frozen $8$-colouring. This settles a question of the second author., Comment: 4 pages, 2 figures
- Published
- 2021
19. Solution to a problem of Katona on counting cliques of weighted graphs
- Author
-
Borg, Peter, Feghali, Carl, and Pellerin, Rémi
- Published
- 2024
- Full Text
- View/download PDF
20. Decomposing a triangle-free planar graph into a forest and a subcubic forest
- Author
-
Feghali, Carl and Šámal, Robert
- Published
- 2024
- Full Text
- View/download PDF
21. Kempe equivalence of $4$-critical planar graphs
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
Answering a question of Mohar from 2007, we show that for every $4$-critical planar graph, its set of $4$-colorings is a Kempe class., Comment: 10 pages, 3 figures; incorporated referees' suggestions
- Published
- 2021
22. The maximum sum of sizes of cross-intersecting families of subsets of a set
- Author
-
Borg, Peter and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05D05 - Abstract
A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq k \leq n$, let ${[n] \choose \leq k}$ denote the family of subsets of $[n] = \{1, \dots, n\}$ that have at most $k$ elements. We show that if $\mathcal{A}$ is a non-empty subfamily of ${[n] \choose \leq r}$, $\mathcal{B}$ is a non-empty subfamily of ${[n] \choose \leq s}$, $r \leq s$, and $\mathcal{A}$ and $\mathcal{B}$ are cross-intersecting, then \[|\mathcal{A}| + |\mathcal{B}| \leq 1 + \sum_{i=1}^s \left({n \choose i} - {n-r \choose i} \right),\] and equality holds if $\mathcal{A} = \{[r]\}$ and $\mathcal{B}$ is the family of sets in ${[n] \choose \leq s}$ that intersect $[r]$., Comment: 7 pages, a typo in the abstract and in Theorem 1 has been corrected. arXiv admin note: text overlap with arXiv:1402.3969
- Published
- 2020
23. Decomposing a triangle-free planar graph into a forest and a subcubic forest
- Author
-
Feghali, Carl and Šámal, Robert
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most $5$, showing that $5$ can be replaced by $3$., Comment: 9 pages; implemented referees' suggestions
- Published
- 2020
24. Partitioning into degenerate graphs in linear time
- Author
-
Corsini, Timothée, Deschamps, Quentin, Feghali, Carl, Gonçalves, Daniel, Langlois, Hélène, and Talon, Alexandre
- Published
- 2023
- Full Text
- View/download PDF
25. A simple proof of Talbot's theorem for intersecting separated sets
- Author
-
Borg, Peter and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05D05 - Abstract
A subset $A$ of $[n] = \{1, \dots, n\}$ is $k$-separated if, when the elements of $[n]$ are considered on a circle, between any two elements of $A$ there are at least $k$ elements of $[n]$ that are not in $A$. A family $\mathcal{A}$ of sets is intersecting if every two sets in $\mathcal{A}$ intersect. We give a short and simple proof of a remarkable result of Talbot (2003), stating that if $n \geq (k + 1)r$ and $\mathcal{A}$ is an intersecting family of $k$-separated $r$-element subsets of $[n]$, then $|\mathcal{A}| \leq \binom{n - kr - 1}{r - 1}$. This bound is best possible., Comment: 6 pages; expanded on the introduction
- Published
- 2020
26. A Thomassen-type method for planar graph recoloring
- Author
-
Dvořák, Zdeněk and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertices all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex. We use a list coloring technique inspired by results of Thomassen to prove that for a planar graph $G$ with $n$ vertices, $R_{10}(G)$ has diameter at most $8n$, and if $G$ is triangle-free, then $R_7(G)$ has diameter at most $7n$., Comment: 20 pages
- Published
- 2020
27. An update on reconfiguring $10$-colorings of planar graphs
- Author
-
Dvořák, Zdeněk and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05C15 - Abstract
The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertex set the set of all possible proper $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex. A result of Bousquet and Perarnau (2016) regarding graphs of bounded degeneracy implies that if $G$ is a planar graph with $n$ vertices, then $R_{12}(G)$ has diameter at most $6n$. We improve on the number of colors, showing that $R_{10}(G)$ has diameter at most $8n$ for every planar graph $G$ with $n$ vertices., Comment: 25 pages, 1 figure
- Published
- 2020
28. Intersecting families, signed sets, and injection
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05D05 - Abstract
Let $k, r, n \geq 1$ be integers, and let $\S_{n, k, r}$ be the family of $r$-signed $k$-sets on $[n] = \{1, \dots, n\}$ given by $$ \mathcal{S}_{n, k, r} = \Big\{\{(x_1, a_1), \dots, (x_k, a_k)\}: \{x_1, \dots, x_k\} \in \binom{[n]}{k}, a_1, \dots, a_k \in [r] \Big\}. $$ A family $\mathcal{A} \subseteq \S_{n, k, r}$ is \emph{intersecting} if $A, B \in \mathcal{A}$ implies $A \cap B \not= \emptyset$. A well-known result (first stated by Meyer and proved using different methods by Deza and Frankl, and Bollob\'as and Leader) states that if $\mathcal{A} \subseteq \mathcal{S}_{n, k, r}$ is intersecting, $r \geq 2$ and $1 \leq k \leq n$, then $$|\mathcal{A}| \leq r^{k-1}\binom{n-1}{k - 1}.$$ We provide a proof of this result by injection (in the same spirit as Frankl and F\"uredi's and Hurlbert and Kamat's injective proofs of the Erd\H{o}s--Ko--Rado Theorem, and Frankl's and Hurlbert and Kamat's injective proofs of the Hilton--Milner Theorem) whenever $r \geq 2$ and $1 \leq k \leq n/2$, leaving open only some cases when $k \leq n$., Comment: 7 pages; differs from the journal version in that reference 7 has been added
- Published
- 2019
29. An Erd\H{o}s-Ko-Rado Theorem for unions of length 2 paths
- Author
-
Feghali, Carl, Hurlbert, Glenn, and Kamat, Vikram
- Subjects
Mathematics - Combinatorics ,05D05 - Abstract
A family of sets is intersecting if any two sets in the family intersect. Given a graph $G$ and an integer $r\geq 1$, let $\mathcal{I}^{(r)}(G)$ denote the family of independent sets of size $r$ of $G$. For a vertex $v$ of $G$, the family of independent sets of size $r$ that contain $v$ is called an $r$-star. Then $G$ is said to be $r$-EKR if no intersecting subfamily of $ \mathcal{I}^{(r)}(G)$ is bigger than the largest $r$-star. Let $n$ be a positive integer, and let $G$ consist of the disjoint union of $n$ paths each of length 2. We prove that if $1 \leq r \leq n/2$, then $G$ is $r$-EKR. This affirms a longstanding conjecture of Holroyd and Talbot for this class of graphs and can be seen as an analogue of a well-known theorem on signed sets, proved using different methods, by Deza and Frankl and by Bollob\'as and Leader. Our main approach is a novel probabilistic extension of Katona's elegant cycle method, which might be of independent interest., Comment: 12 pages, 1 figure. To appear in Discrete Mathematics
- Published
- 2019
30. Kempe equivalent list colorings revisited
- Author
-
Chakraborty, Dibyayan, primary, Feghali, Carl, additional, and Mahmoud, Reem, additional
- Published
- 2024
- Full Text
- View/download PDF
31. The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
- Author
-
Borg Peter and Feghali Carl
- Subjects
cycle ,independent set ,intersecting family ,erdős-ko-rado theorem ,hilton-spencer theorem ,katona’s shadow intersection theorem ,05d05 ,05c35 ,05c38 ,05c69 ,Mathematics ,QA1-939 - Abstract
A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element. A graph G is said to be r-EKR if at least one of the largest intersecting families of independent r-element sets of G is trivial. Let α (G) and ω (G) denote the independence number and the clique number of G, respectively. Hilton and Spencer recently showed that if G is the vertex-disjoint union of a cycle C raised to the power k and s cycles 1C, . . ., sC raised to the powers k1, . . ., ks, respectively, 1 ≤ r ≤ α (G), andmin(ω(C1k1),…,ω(Csks))≥ω(Ck),\min \left( {\omega \left( {{}_1{C^{k1}}} \right), \ldots ,\omega \left( {{}_s{C^{ks}}} \right)} \right) \ge \omega \left( {{C^k}} \right), then G is r-EKR. They had shown that the same holds if C is replaced by a path P and the condition on the clique numbers is relaxed to min(ω(C1k1),…,ω(Csks))≥ω(Pk),\min \left( {\omega \left( {{}_1{C^{k1}}} \right), \ldots ,\omega \left( {{}_s{C^{ks}}} \right)} \right) \ge \omega \left( {{P^k}} \right),
- Published
- 2023
- Full Text
- View/download PDF
32. On the Hilton-Spencer intersection theorems for unions of cycles
- Author
-
Borg, Peter and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05D05 - Abstract
A family $\mathcal{A}$ of sets is said to be intersecting if every two sets in $\mathcal{A}$ intersect. An intersecting family is said to be \emph{trivial} it its sets have a common element. A graph $G$ is said to be $r$-EKR if at least one of the largest intersecting families of independent $r$-element sets of $G$ is trivial. Let $\alpha(G)$ and $\omega(G)$ denote the independence number and the clique number of $G$, respectively. Hilton and Spencer recently showed that if $G$ is the vertex-disjoint union of a cycle ${_*C}$ raised to the power $k^*$ and $s$ cycles ${_1C}, \dots, {_sC}$ raised to the powers $k_1, \dots, k_s$, respectively, $1 \leq r \leq \alpha(G)$, and $$\min\big(\omega(_1C^{k_1}), \dots, \omega(_sC^{k_s})\big) \geq 2k^* + 1,$$ then $G$ is $r$-EKR. They had shown that the same holds if ${_*C}$ is replaced by a path and the condition on the clique numbers is relaxed to $$\min\big(\omega(_1C^{k_1}), \dots, \omega(_sC^{k_s})\big) \geq k^* + 1.$$ We use the classical Shadow Intersection Theorem of Katona to obtain a short proof of each result for the case where the inequality for the minimum clique number is strict., Comment: 9 pages
- Published
- 2019
33. On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
- Author
-
Dabrowski, Konrad K., Feghali, Carl, Johnson, Matthew, Paesani, Giacomo, Paulusma, Daniël, and Rzążewski, Paweł
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Computational Complexity ,Computer Science - Discrete Mathematics ,Mathematics - Combinatorics - Abstract
A graph is $H$-free if it contains no induced subgraph isomorphic to $H$. We prove new complexity results for the two classical cycle transversal problems Feedback Vertex Set and Odd Cycle Transversal by showing that they can be solved in polynomial time on $(sP_1+P_3)$-free graphs for every integer $s\geq 1$. We show the same result for the variants Connected Feedback Vertex Set and Connected Odd Cycle Transversal. We also prove that the latter two problems are polynomial-time solvable on cographs; this was already known for Feedback Vertex Set and Odd Cycle Transversal. We complement these results by proving that Odd Cycle Transversal and Connected Odd Cycle Transversal are NP-complete on $(P_2+P_5,P_6)$-free graphs., Comment: 21 pages, 5 figures
- Published
- 2019
34. Reconfiguring colorings of graphs with bounded maximum average degree
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C15 - Abstract
The reconfiguration graph $R_k(G)$ for the $k$-colorings of a graph $G$ has as vertex set the set of all possible $k$-colorings of $G$ and two colorings are adjacent if they differ in the color of exactly one vertex of $G$. Let $d, k \geq 1$ be integers such that $k \geq d+1$. We prove that for every $\epsilon > 0$ and every graph $G$ with $n$ vertices and maximum average degree $d - \epsilon$, $R_k(G)$ has diameter $O(n(\log n)^{d - 1})$. This significantly strengthens several existing results., Comment: 7 pages; minor clarifications beyond the published version
- Published
- 2019
35. Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs
- Author
-
Feghali, Carl and Fiala, Jiří
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C15 - Abstract
The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph $G$ contains as its vertex set the $k$-colourings of $G$ and two colourings are joined by an edge if they differ in colour on just one vertex of $G$. We show that for each $k \geq 3$ there is a $k$-colourable weakly chordal graph $G$ such that $R_{k+1}(G)$ is disconnected. We also introduce a subclass of $k$-colourable weakly chordal graphs which we call $k$-colourable compact graphs and show that for each $k$-colourable compact graph $G$ on $n$ vertices, $R_{k+1}(G)$ has diameter $O(n^2)$. We show that this class contains all $k$-colourable co-chordal graphs and when $k = 3$ all $3$-colourable $(P_5, \overline{P_5}, C_5)$-free graphs. We also mention some open problems., Comment: 9 pages, 4 figures; minor changes
- Published
- 2019
36. Reconfiguring 10-colourings of planar graphs
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C15 - Abstract
Let $k \geq 1$ be an integer. The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on exactly one vertex. A conjecture of Cereceda from 2007 asserts that for every integer $\ell \geq k + 2$ and $k$-degenerate graph $G$ on $n$ vertices, $R_{\ell}(G)$ has diameter $O(n^2)$. The conjecture has been verified only when $\ell \geq 2k + 1$. We give a simple proof that if $G$ is a planar graph on $n$ vertices, then $R_{10}(G)$ has diameter at most $n^2$. Since planar graphs are $5$-degenerate, this affirms Cereceda's conjecture for planar graphs in the case $\ell = 2k$., Comment: 5 pages; added a corollary and other minor changes
- Published
- 2019
37. The Erd\H{o}s-Ko-Rado property of trees of depth two
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05D05 - Abstract
A family of sets is intersecting if any two sets in the family intersect. Given a graph $G$ and an integer $r\geq 1$, let $\mathcal{I}^{(r)}(G)$ denote the family of independent sets of size $r$ of $G$. For a vertex $v$ of $G$, let $\mathcal{I}^{(r)}_v(G)$ denote the family of independent sets of size $r$ that contain $v$. This family is called an $r$-star. Then $G$ is said to be $r$-EKR if no intersecting subfamily of $ \mathcal{I}^{(r)}(G)$ is bigger than the largest $r$-star. Let $k, n, r \geq 1$, and let $T(n, k)$ be the tree of depth two in which the root has degree $n$ and every neighbour of the root has the same number $k + 1$ of neighbours. For each $k \geq 2$, we show that $T(n, k)$ is $r$-EKR if $2r \leq n$, extending results of Borg and of Feghali, Johnson and Thomas who considered the case $k = 1$., Comment: As kindly pointed out to me by Hurlbert, the proof of Claim 2 has a serious error. As a result, the article has been withdrawn
- Published
- 2018
38. Enclosings of Decompositions of Complete Multigraphs in $2$-Edge-Connected $r$-Factorizations
- Author
-
Asplund, John, Charbit, Pierre, and Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05B99 - Abstract
A decomposition of a multigraph $G$ is a partition of its edges into subgraphs $G(1), \ldots , G(k)$. It is called an $r$-factorization if every $G(i)$ is $r$-regular and spanning. If $G$ is a subgraph of $H$, a decomposition of $G$ is said to be enclosed in a decomposition of $H$ if, for every $1 \leq i \leq k$, $G(i)$ is a subgraph of $H(i)$. Feghali and Johnson gave necessary and sufficient conditions for a given decomposition of $\lambda K_n$ to be enclosed in some $2$-edge-connected $r$-factorization of $\mu K_{m}$ for some range of values for the parameters $n$, $m$, $\lambda$, $\mu$, $r$: $r=2$, $\mu>\lambda$ and either $m \geq 2n-1$, or $m=2n-2$ and $\mu = 2$ and $\lambda=1$, or $n=3$ and $m=4$. We generalize their result to every $r \geq 2$ and $m \geq 2n - 2$. We also give some sufficient conditions for enclosing a given decomposition of $\lambda K_n$ in some $2$-edge-connected $r$-factorization of $\mu K_{m}$ for every $r \geq 3$ and $m = (2 - C)n$, where $C$ is a constant that depends only on $r$, $\lambda$ and~$\mu$., Comment: 17 pages; fixed the proof of Theorem 1.4 and other minor changes
- Published
- 2018
39. Towards Cereceda's conjecture for planar graphs
- Author
-
Eiben, Eduard and Feghali, Carl
- Subjects
Computer Science - Discrete Mathematics ,Mathematics - Combinatorics ,05C15 - Abstract
The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph $G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on the colour of exactly one vertex. Cereceda conjectured ten years ago that, for every $k$-degenerate graph $G$ on $n$ vertices, $R_{k+2}(G)$ has diameter $\mathcal{O}({n^2})$. The conjecture is wide open, with a best known bound of $\mathcal{O}({k^n})$, even for planar graphs. We improve this bound for planar graphs to $2^{\mathcal{O}({\sqrt{n}})}$. Our proof can be transformed into an algorithm that runs in $2^{\mathcal{O}({\sqrt{n}})}$ time., Comment: 12 pages
- Published
- 2018
40. Dirac's theorem on chordal graphs implies Brooks' theorem
- Author
-
Feghali, Carl, primary
- Published
- 2024
- Full Text
- View/download PDF
41. Partitioning a graph into degenerate subgraphs
- Author
-
Abu-Khzam, Faisal N., Feghali, Carl, and Heggernes, Pinar
- Subjects
Computer Science - Discrete Mathematics ,Mathematics - Combinatorics ,05C70 - Abstract
Let $G = (V, E)$ be a connected graph with maximum degree $k\geq 3$ distinct from $K_{k+1}$. Given integers $s \geq 2$ and $p_1,\ldots,p_s\geq 0$, $G$ is said to be $(p_1, \dots, p_s)$-partitionable if there exists a partition of $V$ into sets~$V_1,\ldots,V_s$ such that $G[V_i]$ is $p_i$-degenerate for $i\in\{1,\ldots,s\}$. In this paper, we prove that we can find a $(p_1, \dots, p_s)$-partition of $G$ in $O(|V| + |E|)$-time whenever $1\geq p_1, \dots, p_s \geq 0$ and $p_1 + \dots + p_s \geq k - s$. This generalizes a result of Bonamy et al. (MFCS, 2017) and can be viewed as an algorithmic extension of Brooks' theorem and several results on vertex arboricity of graphs of bounded maximum degree. We also prove that deciding whether $G$ is $(p, q)$-partitionable is $\mathbb{NP}$-complete for every $k \geq 5$ and pairs of non-negative integers $(p, q)$ such that $(p, q) \not = (1, 1)$ and $p + q = k - 3$. This resolves an open problem of Bonamy et al. (manuscript, 2017). Combined with results of Borodin, Kostochka and Toft (\emph{Discrete Mathematics}, 2000), Yang and Yuan (\emph{Discrete Mathematics}, 2006) and Wu, Yuan and Zhao (\emph{Journal of Mathematical Study}, 1996), it also settles the complexity of deciding whether a graph with bounded maximum degree can be partitioned into two subgraphs of prescribed degeneracy., Comment: 16 pages; minor revision
- Published
- 2018
42. Paths between colourings of sparse graphs
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,Computer Science - Discrete Mathematics ,05C15 - Abstract
The reconfiguration graph $R_k(G)$ of the $k$-colourings of a graph~$G$ has as vertex set the set of all possible $k$-colourings of $G$ and two colourings are adjacent if they differ on exactly one vertex. We give a short proof of the following theorem of Bousquet and Perarnau (\emph{European Journal of Combinatorics}, 2016). Let $d$ and $k$ be positive integers, $k \geq d + 1$. For every $\epsilon > 0$ and every graph $G$ with $n$ vertices and maximum average degree $d - \epsilon$, there exists a constant $c = c(d, \epsilon)$ such that $R_k(G)$ has diameter $O(n^c)$. Our proof can be transformed into a simple polynomial time algorithm that finds a path between a given pair of colourings in $R_k(G)$., Comment: 3 pages
- Published
- 2018
43. The maximum sum of sizes of cross-intersecting families of subsets of a set
- Author
-
Borg, Peter and Feghali, Carl
- Published
- 2022
- Full Text
- View/download PDF
44. Intersecting non-uniform families containing subfamilies
- Author
-
Feghali, Carl
- Subjects
Mathematics - Combinatorics ,05D05 - Abstract
A family of sets is said to be intersecting if every pair of sets in the family have non-empty intersection. In this paper, we initiate the study of intersecting non-uniform families of sets of one of two sizes containing given subfamilies. For a set $X$ and integer $r$, let $\binom{X}{r}$ denote the family $\{A \subseteq X: |X| = r\}$. Let $a$, $b$, and $n$ be positive integers such that $a < b$. We determine the maximum size of an intersecting family in $\binom{[n]}{a} \cup \binom{[2n]}{b}$ whenever $n > b$. For $n$ sufficiently large, we also determine the maximum size of an intersecting family in $\binom{[2n]}{a} \cup \binom{[n+1, 3n]}{a} \cup \binom{[n] \cup [2n + 1, 3n]}{a} \cup \binom{[3n]}{b}$ whenever $3n > 2b$ and $b > a + 2$. Our results are, in some sense, best possible. Our methods include the use of Katona's shadow intersection theorem and a recent diversity theorem of Kupavskii and~Zakharov., Comment: Not sufficiently interesting
- Published
- 2017
45. A short proof of Talbot’s theorem for intersecting separated sets
- Author
-
Borg, Peter and Feghali, Carl
- Published
- 2022
- Full Text
- View/download PDF
46. Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration
- Author
-
Bonamy, Marthe, Dabrowski, Konrad K., Feghali, Carl, Johnson, Matthew, and Paulusma, Daniel
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics ,Mathematics - Combinatorics - Abstract
We continue research into a well-studied family of problems that ask whether the vertices of a graph can be partitioned into sets $A$ and~$B$, where $A$ is an independent set and $B$ induces a graph from some specified graph class ${\cal G}$. We let ${\cal G}$ be the class of $k$-degenerate graphs. This problem is known to be polynomial-time solvable if $k=0$ (bipartite graphs) and NP-complete if $k=1$ (near-bipartite graphs) even for graphs of maximum degree $4$. Yang and Yuan [DM, 2006] showed that the $k=1$ case is polynomial-time solvable for graphs of maximum degree $3$. This also follows from a result of Catlin and Lai [DM, 1995]. We consider graphs of maximum degree $k+2$ on $n$ vertices. We show how to find $A$ and $B$ in $O(n)$ time for $k=1$, and in $O(n^2)$ time for $k\geq 2$. Together, these results provide an algorithmic version of a result of Catlin [JCTB, 1979] and also provide an algorithmic version of a generalization of Brook's Theorem, which was proven in a more general way by Borodin, Kostochka and Toft [DM, 2000] and Matamala [JGT, 2007]. Moreover, the two results enable us to complete the complexity classification of an open problem of Feghali et al. [JGT, 2016]: finding a path in the vertex colouring reconfiguration graph between two given $\ell$-colourings of a graph of maximum degree $k$.
- Published
- 2017
47. Independent Feedback Vertex Set for $P_5$-free Graphs
- Author
-
Bonamy, Marthe, Dabrowski, Konrad K., Feghali, Carl, Johnson, Matthew, and Paulusma, Daniel
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics ,Mathematics - Combinatorics - Abstract
The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer $k\geq 0$, to delete at most $k$ vertices from a given graph so that what remains is a forest. The variant in which the deleted vertices must form an independent set is called Independent Feedback Vertex Set and is also NP-complete. In fact, even deciding if an independent feedback vertex set exists is NP-complete and this problem is closely related to the $3$-Colouring problem, or equivalently, to the problem of deciding whether or not a graph has an independent odd cycle transversal, that is, an independent set of vertices whose deletion makes the graph bipartite. We initiate a systematic study of the complexity of Independent Feedback Vertex Set for $H$-free graphs. We prove that it is NP-complete if $H$ contains a claw or cycle. Tamura, Ito and Zhou proved that it is polynomial-time solvable for $P_4$-free graphs. We show that it remains polynomial-time solvable for $P_5$-free graphs. We prove analogous results for the Independent Odd Cycle Transversal problem, which asks whether or not a graph has an independent odd cycle transversal of size at most $k$ for a given integer $k\geq 0$. Finally, in line with our underlying research aim, we compare the complexity of Independent Feedback Vertex Set for $H$-free graphs with the complexity of $3$-Colouring, Independent Odd Cycle Transversal and other related problems.
- Published
- 2017
48. Independent Feedback Vertex Sets for Graphs of Bounded Diameter
- Author
-
Bonamy, Marthe, Dabrowski, Konrad K., Feghali, Carl, Johnson, Matthew, and Paulusma, Daniel
- Subjects
Computer Science - Data Structures and Algorithms ,Computer Science - Discrete Mathematics ,Mathematics - Combinatorics - Abstract
The Near-Bipartiteness problem is that of deciding whether or not the vertices of a graph can be partitioned into sets $A$ and $B$, where $A$ is an independent set and $B$ induces a forest. The set $A$ in such a partition is said to be an independent feedback vertex set. Yang and Yuan proved that Near-Bipartiteness is polynomial-time solvable for graphs of diameter 2 and NP-complete for graphs of diameter 4. We show that Near-Bipartiteness is NP-complete for graphs of diameter 3, resolving their open problem. We also generalise their result for diameter 2 by proving that even the problem of computing a minimum independent feedback vertex is polynomial-time solvable for graphs of diameter 2.
- Published
- 2017
49. 1-Extendability of Independent Sets
- Author
-
Bergé, Pierre, primary, Busson, Anthony, additional, Feghali, Carl, additional, and Watrigant, Rémi, additional
- Published
- 2022
- Full Text
- View/download PDF
50. Three remarks on W graphs
- Author
-
Feghali, Carl, primary and Marin, Malory, additional
- Published
- 2024
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.