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...
Prif Awduron: | Fox, J, Nguyen, T, Scott, A, Seymour, P |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Elsevier
2024
|
Eitemau Tebyg
-
Apex Graphs and Cographs
gan: Jagdeep Singh, et al.
Cyhoeddwyd: (2024-01-01) -
Sombor characteristic values of cographs
gan: Zahid Raza, et al.
Cyhoeddwyd: (2024-10-01) -
Graphic Splitting of Cographic Matroids
gan: Pirouz Naiyer
Cyhoeddwyd: (2015-02-01) -
Dense subgraphs in random graphs
gan: Balister, P, et al.
Cyhoeddwyd: (2019) -
The component structure of dense random subgraphs of the hypercube
gan: McDiarmid, C, et al.
Cyhoeddwyd: (2021)