20 citations · 171 across the 37 of their papers we have counts for
5 papers · 1 filter
Idealness of -wise intersecting families
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh +1
A clutter is \emph{-wise intersecting} if every members have a common element, yet no element belongs to all members. We conjecture that, for some integer , every $…
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles
Michele Conforti, Samuel Fiorini, Tony Huynh +1
Let be an -node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC'17) for bimodular integer programs can be used to find a maxi…
The stable set problem in graphs with bounded genus and bounded odd cycle packing number
Michele Conforti, Samuel Fiorin, Tony Huynh +2
Consider the family of graphs without node-disjoint odd cycles, where is a constant. Determining the complexity of the stable set problem for such graphs is a lon…
Unavoidable minors for graphs with large -dimension
Samuel Fiorini, Tony Huynh, Gwenaël Joret +1
A metric graph is a pair , where is a graph and is a distance function. Let be fixed. An isometric embedding of the met…
Flip distances between graph orientations
Oswin Aichholzer, Jean Cardinal, Tony Huynh +4
Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance…