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
|
類似資料
-
Apex Graphs and Cographs
著者:: Jagdeep Singh, 等
出版事項: (2024-01-01) -
Sombor characteristic values of cographs
著者:: Zahid Raza, 等
出版事項: (2024-10-01) -
Graphic Splitting of Cographic Matroids
著者:: Pirouz Naiyer
出版事項: (2015-02-01) -
Dense subgraphs in random graphs
著者:: Balister, P, 等
出版事項: (2019) -
The component structure of dense random subgraphs of the hypercube
著者:: McDiarmid, C, 等
出版事項: (2021)