Equivalent Subgraphs of Order $3$
It is proved that any graph of order $14n/3 + O(1)$ contains a family of n induced subgraphs of order $3$ such that they are vertex-disjoint and equivalent to each other.
-д хадгалсан:
| Үндсэн зохиолч: | |
|---|---|
| Формат: | Artigo |
| Хэл сонгох: | Inglês |
| Хэвлэсэн: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Цуврал: | Discrete Mathematics & Theoretical Computer Science |
| Нөхцлүүд: | |
| Онлайн хандалт: | https://dmtcs.episciences.org/3460/pdf |
| Шошгууд: |
Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!
|