Vertex partition of hypergraphs and maximum degenerate subhypergraphs
<p class="p1">In 2007 Matamala proved that if <em>G</em> is a simple graph with maximum degree Δ ≥ 3 not containing <em>K</em><sub>Δ+1</sub> as a subgraph and <em>s</em>, <em>t</em> are positive integers such that <em>s</em>+<em>t</em> ≥ Δ, then the vertex set of <em>G</em> admits a partition (<em>S...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2021-04-01
|
| Seri Bilgileri: | Electronic Journal of Graph Theory and Applications |
| Konular: | |
| Online Erişim: | http://www.ejgta.org/index.php/ejgta/article/view/641 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|