Induced subgraph density. II. Sparse and dense sets in cographs

A well-known theorem of Rödl says that for every graph H, and every ε > 0, there exists δ > 0 such that if G does not contain an induced copy of H, then there exists X ⊆ V (G) with |X| ≥ δ|G| such that one of G[X], G[X] has edge-density at most ε. But how does δ depend on ε? Fox and Sudakov co...

詳細記述

書誌詳細
主要な著者: Fox, J, Nguyen, T, Scott, A, Seymour, P
フォーマット: Journal article
言語:English
出版事項: Elsevier 2024

類似資料