29 citations · 334 across the 88 of their papers we have counts for
12 papers · 1 filter
Maximum independent sets in (pyramid, even hole)-free graphs
Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon +1
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-free} if it does not contain a hole on an even number of vertices. A \emph{pyramid…
Subdivided Claws and the Clique-Stable Set Separation Property
Maria Chudnovsky, Paul Seymour
Let be a class of graphs closed under taking induced subgraphs. We say that has the {\em clique-stable set separation property} if there exists $c \in \…
Strongly Perfect Claw-free Graphs -- A Short Proof
Maria Chudnovsky, Cemil Dibek
A graph is strongly perfect if every induced subgraph H has a stable set that meets every maximal clique of H. A graph is claw-free if no vertex has three pairwise non-adjacent nei…
Small families under subdivision
Maria Chudnovsky, Martin Loebl, Paul Seymour
Let be a graph with maximum degree , and let . We show that for some depending on , and all integers , there are at most unlabelled simple…
Even-hole-free graphs still have bisimplicial vertices
Maria Chudnovsky, Paul Seymour
A {\em hole} in a graph is an induced subgraph which is a cycle of length at least four. A hole is called {\em even} if it has an even number of vertices. An {\em even-hole-free} g…
Induced equators in flag spheres
Maria Chudnovsky, Eran Nevo
We propose a combinatorial approach to the following strengthening of Gal's conjecture: coefficientwise, where is a flag homology sphere and an in…