Carl Feghali

activity

20162025

most citedMatching Cuts in Graphs of High Girth and H-Free Graphs

2 citations · 2 across the 14 of their papers we have counts for

collaborators

Showing 2019Show all

7 papers · 1 filter

math.CO2019

Intersecting families, signed sets, and injection

Carl Feghali

Let $k, r, n \geq 1$ be integers, and let $§_{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), \dot…

math.CO2019

An Erdős-Ko-Rado Theorem for unions of length 2 paths

Carl Feghali, Glenn Hurlbert, Vikram Kamat

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 $I^{(r)} (G)$ denote the family of independent se…

math.CO2019

On the Hilton-Spencer intersection theorems for unions of cycles

Peter Borg, Carl Feghali

A family $A$ of sets is said to be intersecting if every two sets in $A$ intersect. An intersecting family is said to be \emph{trivial} it its sets have a commo…

cs.DS2019

On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

Konrad K. Dabrowski, Carl Feghali, Matthew Johnson +3

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 O…

math.CO2019

Reconfiguring colorings of graphs with bounded maximum average degree

Carl Feghali

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…

math.CO2019

Reconfiguring 10-colourings of planar graphs

Carl Feghali

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 colour…