P. Seymour

most citedInduced subgraph density. IV. New graphs with the ErdÅs-Hajnal property

1 citations · 1 across the 1 of their papers we have counts for

collaborators

2 papers

math.CO2026★ 1 cited

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 $H$ , there exists $c > 0$ such that every $H$ -free graph $G$ has a clique or a stable set of size at least $∣ G ∣^{c}$ (a graph is $H$ -…

math.CO2024

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 $H$ , there exists $c > 0$ such that every $H$ -free graph on $n$ vertices has a clique or stable set of size at least $n^{c}$ . In…

Induced subgraph density. IV. New graphs with the ErdÅs-Hajnal property

Induced subgraph density. V. All paths approach Erdos-Hajnal

Induced subgraph density. IV. New graphs with the ErdÅs-Hajnal property