34 citations · 188 across the 74 of their papers we have counts for
100 papers
Excluding the fork and antifork
Maria Chudnovsky, Linda Cook, Paul Seymour
The fork is the tree obtained from the claw by subdividing one of its edges once, and the antifork is its complement graph. We give a complete description of all graphs t…
Induced subgraph density. V. All paths approach Erdos-Hajnal
Tung Nguyen, Alex Scott, Paul Seymour
The Erdős-Hajnal conjecture says that, for every graph , there exists such that every -free graph on vertices has a clique or stable set of size at least . In…
Induced subgraph density. IV. New graphs with the Erdős-Hajnal property
Tung Nguyen, Alex Scott, Paul Seymour
Erdős and Hajnal conjectured that for every graph , there exists such that every -free graph has a clique or a stable set of size at least (a graph is -f…
Induced subgraph density. III. Cycles and subdivisions
Tung Nguyen, Alex Scott, Paul Seymour
We show that for every two cycles , there exists such that if is both -free and -free then has a clique or stable set of size at least .…
Induced subgraph density. II. Sparse and dense sets in cographs
Jacob Fox, Tung Nguyen, Alex Scott +1
A well-known theorem of Rödl says that for every graph , and every , there exists such that if does not contain an induced copy of , then there exists $X\subse…
Bounded diameter tree-decompositions
Eli Berger, Paul Seymour
When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic graph theory, where it is calle…