Pure pairs. IX. Transversal trees
<p>Fix <em>k</em>>0, and let <em>G</em> be a graph, with vertex set partitioned into <em>k</em> subsets (“blocks”) of approximately equal size. An induced subgraph of <em>G</em> is “transversal&rd...
| Asıl Yazarlar: | , , |
|---|---|
| Materyal Türü: | Journal article |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Society for Industrial and Applied Mathematics
2024
|