29 citations · 334 across the 88 of their papers we have counts for
9 papers · 2 filters
Attempting perfect hypergraphs
Maria Chudnovsky, Gil Kalai
We study several extensions of the notion of perfect graphs to -uniform hypergraphs.
Stable sets in flag spheres
Maria Chudnovsky, Eran Nevo
We provide lower and upper bounds on the minimum size of a maximum stable set over graphs of flag spheres, as a function of the dimension of the sphere and the number of vertices.…
Non-uniform degrees and rainbow versions of the Caccetta-Häggkvist conjecture
Ron Aharoni, Eli Berger, Maria Chudnovsky +2
The Caccetta-Häggkvist conjecture (denoted below CHC) states that the directed girth (the smallest length of a directed cycle) of a directed graph on vertices i…
Submodular functions and perfect graphs
Tara Abrishami, Maria Chudnovsky, Cemil Dibek +1
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four…
Induced subgraphs and tree decompositions III. Three-path-configurations and logarithmic treewidth
Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi +1
A theta is a graph consisting of two non-adjacent vertices and three internally disjoint paths between them, each of length at least two. For a family of graphs, we s…
Forbidden induced pairs for perfectness and -colourability of graphs
Maria Chudnovsky, Adam Kabela, Binlong Li +1
We characterise the pairs of graphs such that all -free graphs (distinct from ) are perfect. Similarly, we characterise pairs such that a…