activity
20022024
most citedSubstitution and -Boundedness

29 citations · 334 across the 88 of their papers we have counts for

collaborators
Showing 2013 · math.COShow all

10 papers · 2 filters

math.CO2013

Bipartite Minors

Maria Chudnovsky, Gil Kalai, Eran Nevo +2

We introduce a notion of bipartite minors and prove a bipartite analog of Wagner's theorem: a bipartite graph is planar if and only if it does not contain as a bipartite…

math.CO2013★ 11 cited

Excluding induced subdivisions of the bull and related graphs

Maria Chudnovsky, Irena Penev, Alexander Scott +1

For any graph , let be the class of graphs with no induced subdivision of . It was conjectured in [A.D. Scott, Induced trees in graphs of large chromatic nu…

math.CO2013★ 4 cited

On the Erdös-Lovász Tihany Conjecture for Claw-Free Graphs

Maria Chudnovsky, Alexandra Fradkin, Matthieu Plumettaz

In 1968, Erdös and Lovász conjectured that for every graph and all integers such that , there exists a partition of the vertex set of …

math.CO2013★ 7 cited

Wheel-free planar graphs

Pierre Aboulker, Maria Chudnovsky, Paul Seymour +1

A \emph{wheel} is a graph formed by a chordless cycle and a vertex not in that has at least three neighbors in . We prove that every 3-connected planar graph that do…

math.CO2013★ 1 cited

Immersion in four-edge-connected graphs

Maria Chudnovsky, Zdeněk Dvořák, Tereza Klimošová +1

Fix g>1. Every graph of large enough tree-width contains a g x g grid as a minor; but here we prove that every four-edge-connected graph of large enough tree-width contains a g x g…

math.CO2013

Clique numbers of graph unions

Maria Chudnovsky, Juba Ziani

Let and be two simple graphs with vertex set , and let be the simple graph with vertex set , in which two vertices are adjacent if they are adjacent in at le…